|
Search: id:A140948
|
|
|
| A140948 |
|
P-adic Hailstone (or A033478):instead of 3 Prime[n] is used: a(n)=If[Mod[a(n - 1), 2] == 0, a(n - 1)/2, Prime(n + 1)*a(n - 1) + 1]. |
|
+0
1
|
|
| 3, 10, 5, 36, 18, 9, 154, 77, 1772, 886, 443, 16392, 8196, 4098, 2049, 108598, 54299, 3312240, 1656120, 828060, 414030, 207015, 17182246, 8591123, 833338932, 416669466, 208334733, 22291816432, 11145908216, 5572954108, 2786477054
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 203-204.
|
|
FORMULA
|
a(n)=If[Mod[a(n - 1), 2] == 0, a(n - 1)/2, Prime(n + 1)*a(n - 1) + 1].
|
|
MATHEMATICA
|
a[0] = 3; a[n_] := a[n] = If[Mod[a[n - 1], 2] == 0, a[n - 1]/2, Prime[n + 1]*a[n - 1] + 1]; Table[a[n], {n, 0, 30}]
|
|
CROSSREFS
|
Cf. A033478.
Sequence in context: A035411 A033478 A111127 this_sequence A068489 A088337 A087397
Adjacent sequences: A140945 A140946 A140947 this_sequence A140949 A140950 A140951
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Jul 24 2008
|
|
|
Search completed in 0.002 seconds
|
