



2, 3, 5, 7, 11, 19, 23, 43, 47, 94, 139, 235, 283, 517, 659, 1081, 1319, 2209, 2879, 5758, 8637, 13301, 20147, 30337, 49727, 61993, 103823, 135313, 247439, 366683, 606743, 811879, 1266767, 1739761, 2913671, 3797401, 5827343
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

With a(0) = 1, a(n) = the smallest number m such that number of steps of iterations of {r  (largest divisor d < r)} needed to reach 1 starting at r = m is equal to n. Example (a(5)=11): 111=10; 105=5; 51=4; 42=2; 21=1; number 11 has 5 steps and is the smallest such number. See A000079, A064097, A175125.  Jaroslav Krizek, Feb 15 2010


LINKS

Robert G. Wilson v, Table of n, a(n) for n = 1..50
Pfoertner, Hugo, Program


CROSSREFS

Sequence in context: A079346 A228062 A059878 * A214197 A083771 A158069
Adjacent sequences: A105014 A105015 A105016 * A105018 A105019 A105020


KEYWORD

nonn


AUTHOR

Hugo Pfoertner, Feb 17 2006


STATUS

approved



