|
Search: id:A057614
|
|
|
| A057614 |
|
a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), else 11*a(n)+1. |
|
+0
15
|
|
| 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51, 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51, 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51, 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51, 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51, 17, 188, 94, 47, 518, 259, 37, 408, 204, 102, 51
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
This is the `11x+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
|
|
CROSSREFS
|
Cf. A057446, A057216, A057522, A057534.
Sequence in context: A167578 A025958 A022741 this_sequence A041548 A025931 A115234
Adjacent sequences: A057611 A057612 A057613 this_sequence A057615 A057616 A057617
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Murad A. AlDamen (Divisibility(AT)yahoo.com), Oct 17 2000
|
|
|
Search completed in 0.002 seconds
|
