|
Search: id:A057216
|
|
|
| A057216 |
|
To get next term, multiply by 17, add 1 and discard any prime factors < 17. |
|
+0
15
|
|
| 61, 173, 1471, 521, 4429, 4183, 2963, 257, 437, 743, 1579, 2237, 3803, 2309, 19627, 5561, 47269, 14881, 3833, 32581, 263, 43, 61, 173, 1471, 521, 4429, 4183, 2963, 257, 437, 743, 1579, 2237, 3803, 2309, 19627, 5561, 47269, 14881, 3833, 32581, 263, 43
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
This is the `17x+1' map. The `Px+1 map': if x is divisible by any prime < P then divide out these primes one at a time starting with the smallest; otherwise multiply x by P and add 1.
|
|
REFERENCES
|
Murad A. AlDamen, Smarandache Notion Journal, "Murad iterating function" [details?].
Murad A. AlDamen, Murad iterating function, Journal of University of Jerash, 2001, to appear.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Collatz problem
|
|
EXAMPLE
|
61 -> 17*61+1 = 1038 = 2*3*173 -> 173, so second term is 173.
|
|
CROSSREFS
|
Cf. A057446, A057522, A057534 (long version), A057614.
Adjacent sequences: A057213 A057214 A057215 this_sequence A057217 A057218 A057219
Sequence in context: A142482 A007488 A142538 this_sequence A139993 A088955 A087870
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Murad A. AlDamen (Divisibility(AT)yahoo.com), Oct 17 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu) and Larry Reeves (larryr(AT)acm.org), Oct 18 2000
|
|
|
Search completed in 0.002 seconds
|
