|
Search: id:A162696
|
|
|
| A162696 |
|
Trajectory of 1 under morphism taking n to sorted divisors of n+1. |
|
+0
1
|
|
| 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 5, 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2, 1, 2, 3, 6, 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 5, 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 5, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 4, 1, 7, 1, 2, 1, 3, 1, 2, 1, 2, 4, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
1 -> 1,2; 2->1,3; 3->1,2,4; ...
|
|
EXAMPLE
|
1 -> 1,2 -> 1,2,1,3 -> 1,2,1,3,1,2,1,2,4 -> ...
|
|
PROGRAM
|
(PARI) v=[1, 2]; for(i=2, 60, v=concat(v, divisors(v[i]+1))); v
|
|
CROSSREFS
|
Cf. A007001, A001511, A027750.
Sequence in context: A029423 A059130 A094959 this_sequence A108103 A111376 A157226
Adjacent sequences: A162693 A162694 A162695 this_sequence A162697 A162698 A162699
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jul 10 2009
|
|
|
Search completed in 0.002 seconds
|
