|
Search: id:A136138
|
|
|
| A136138 |
|
a(n+1)=sopfr(4a(n)+1), with sopfr=A001414. Finishes with the cycle (34, 137, 67, 269, 362, 36). |
|
+0
4
|
|
| 1, 5, 10, 41, 19, 18, 73, 293, 43, 173, 24, 97, 389, 179, 242, 39, 157, 54, 38, 23, 34, 137, 67, 269, 362, 36, 34
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
In the class of recurrence sequences a(n+1)=sopfr(C*a(n)+D), with C=4, D=1. It is a simple example where it finishes with a non trivial cycle.
|
|
FORMULA
|
a(n+1)=A001414(4*a(n)+1)
|
|
MATHEMATICA
|
sopfr = Function[x, Plus @@ Map[Times @@ # &, FactorInteger[x]]]; NestList[sopfr[4# + 1] &, 1, 40]
|
|
CROSSREFS
|
Cf. A136136, A136137.
Adjacent sequences: A136135 A136136 A136137 this_sequence A136139 A136140 A136141
Sequence in context: A117865 A001692 A038070 this_sequence A122173 A083515 A103971
|
|
KEYWORD
|
fini,nonn
|
|
AUTHOR
|
Carlos Alves (cjsalves(AT)gmail.com), Dec 16 2007
|
|
|
Search completed in 0.002 seconds
|
