The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333138 a(n) is the length of n-th run of increasing terms of A318199. 1
 17, 2, 5, 1, 4, 1, 5, 1, 1, 3, 2, 4, 2, 3, 4, 11, 1, 4, 4, 1, 2, 5, 4, 2, 3, 3, 1, 8, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 3, 3, 5, 1, 1, 2, 1, 2, 1, 6, 7, 2, 4, 2, 1, 1, 1, 8, 1, 2, 4, 1, 7, 2, 1, 1, 1, 2, 4, 2, 3, 7, 8, 1, 6, 1, 4, 1, 3, 5, 1, 2, 1, 1, 5, 3, 3, 4, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA b[n_]:=Floor[n^(Prime[n]/n)]; a={}; nmax=344; For[i=1, i<=nmax, i++, {For[j=1, b[j+i-1]<=b[j+i], j++], i+=j, AppendTo[a, j]}]; a CROSSREFS Cf. A318199. Sequence in context: A040283 A040285 A040286 * A051311 A040287 A252940 Adjacent sequences: A333135 A333136 A333137 * A333139 A333140 A333141 KEYWORD nonn AUTHOR Stefano Spezia, Mar 09 2020 STATUS approved

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

Last modified December 2 15:42 EST 2022. Contains 358510 sequences. (Running on oeis4.)