The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180447 n appears 3n+1 times. 4
0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
FORMULA
a(n) = floor((sqrt(24n+1)+1)/6).
EXAMPLE
a(5) = floor((sqrt(24*5+1)+1)/6) = 2.
MATHEMATICA
f[n_] := Floor[(Sqrt[24 n + 1] + 1)/6]; Array[f, 105, 0] (* Robert G. Wilson v, Sep 10 2010 *)
PROG
(Python) l = [floor((sqrt(24*n+1)+1)/6) for n in range(0, 101)]
(PARI) a(n) = (sqrtint(24*n+1)+1)\6; \\ Kevin Ryde, Apr 21 2021
CROSSREFS
Cf. A000326 (indices of run starts), A180446.
Sequence in context: A329195 A204164 A257639 * A295866 A115338 A348522
KEYWORD
easy,nonn
AUTHOR
William A. Tedeschi, Sep 07 2010
EXTENSIONS
More terms from Robert G. Wilson v, Sep 10 2010
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 16:19 EDT 2024. Contains 372603 sequences. (Running on oeis4.)