This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105017 Records in A064097. 5
 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): 11-1=10; 10-5=5; 5-1=4; 4-2=2; 2-1=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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 21 00:43 EDT 2017. Contains 290855 sequences.