This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A292031 a(n) is the smallest value m such that n appears in row m of A292030. 4
 0, 0, 0, 0, 3, 0, 5, 3, 0, 4, 9, 3, 11, 0, 4, 7, 15, 5, 3, 9, 6, 0, 21, 4, 23, 12, 8, 13, 5, 3, 29, 15, 10, 6, 0, 11, 35, 4, 7, 19, 39, 13, 41, 8, 14, 5, 45, 3, 9, 24, 16, 25, 51, 6, 53, 0, 18, 28, 11, 19, 4, 7, 20, 12, 63, 21, 65, 33, 13, 8, 69, 23, 71, 5, 24, 37, 3, 9, 15, 39, 26 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS a(n) = 0 if and only if n is a member of A000045. a(n) is never 1 nor 2 since row 1 and 2 are equal to row 0 with a shift. - Michel Marcus, Sep 27 2017, amended by M. F. Hasler, Feb 26 2018 LINKS Ely Golden, Table of n, a(n) for n = 0..10000 EXAMPLE a(3)=0 since A292030(0,5) = 3. a(7)=3 since A292030(3,2) = 7. PROG (Python) def smallestSeq(n):   if(n<0): return []   if(n==0): return [0, 0]   j, r0, r1=0, 0, 1   while(r1<=n): r0, r1=r1, r0+r1 ; j+=1   while(r1>1):     if(n%r1==r0): return [n//r1, j]     r1, r0=r0, r1-r0     j-=1   return [n-1, j] for i in range(10001):   print(str(i)+" "+str(smallestSeq(i)[0])) CROSSREFS Cf. A292030. Sequence in context: A011293 A181884 A284662 * A201565 A088191 A179179 Adjacent sequences:  A292028 A292029 A292030 * A292032 A292033 A292034 KEYWORD nonn AUTHOR Ely Golden, Sep 08 2017 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 13:52 EST 2018. Contains 318063 sequences. (Running on oeis4.)