|
Search: id:A057522
|
|
|
| A057522 |
|
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), a(n)/11 if 11|a(n), else 13*a(n)+1. |
|
+0
13
|
|
| 73, 950, 475, 95, 19, 248, 124, 62, 31, 404, 202, 101, 1314, 657, 219, 73, 950, 475, 95, 19, 248, 124, 62, 31, 404, 202, 101, 1314, 657, 219, 73, 950, 475, 95, 19, 248, 124, 62, 31, 404, 202, 101, 1314, 657, 219, 73, 950, 475, 95, 19, 248, 124, 62, 31, 404, 202
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
This is the `13x+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
|
73 -> 19*73+1 = 950, 950 = 2*5^2*19 -> 950/2 = 475, etc.
|
|
CROSSREFS
|
Cf. A057446 (short version), A057216, A057534, A057614.
Sequence in context: A100412 A104907 A123811 this_sequence A008400 A090685 A008392
Adjacent sequences: A057519 A057520 A057521 this_sequence A057523 A057524 A057525
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Murad A. AlDamen (Divisibility(AT)yahoo.com), Oct 17 2000
|
|
|
Search completed in 0.002 seconds
|
