|
| |
|
|
A057446
|
|
To get next term, multiply by 13, add 1 and discard any prime factors < 13.
|
|
14
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| 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 * A033393 A153646 A179516
Adjacent sequences: A057443 A057444 A057445 * A057447 A057448 A057449
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Murad A. AlDamen (Divisibility(AT)yahoo.com), Oct 17 2000
|
| |
|
|
