|
Search: id:A057446
|
|
|
| A057446 |
|
To get next term, multiply by 13, add 1 and discard any prime factors < 13. |
|
+0
15
|
|
| 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101, 73, 19, 31, 101
(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 = 2*5^2*19 -> 19, so second term is 19.
|
|
CROSSREFS
|
Cf. A057216, A057522 (long version), A057534, A057614.
Sequence in context: A099191 A051325 A102050 this_sequence A033393 A153646 A064667
Adjacent sequences: A057443 A057444 A057445 this_sequence A057447 A057448 A057449
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Murad A. AlDamen (Divisibility(AT)yahoo.com), Oct 17 2000
|
|
|
Search completed in 0.002 seconds
|
