Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A172471 a(n) = floor(sqrt(2*n)). 11
0, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
If k is even, k appears k+1 times; if k is odd, k appears k times. - N. J. A. Sloane, Jan 25 2021
LINKS
N. J. A. Sloane, Table of n, a(n) for n = 0..20000 [First 10000 terms from Vincenzo Librandi]
FORMULA
a(n) = A000196(2*n). - R. J. Mathar, Jul 06 2010
MATHEMATICA
Table[Floor[Sqrt[2n]], {n, 0, 80}]
PROG
(Magma) [Floor(Sqrt(2*n)) : n in [0..80]];
(Haskell)
a172471 = a000196 . (* 2) -- Reinhard Zumkeller, Feb 12 2012
(PARI) for(n=0, 50, print1(floor(sqrt(2*n)), ", ")) \\ G. C. Greubel, Jul 06 2017
CROSSREFS
Sequence in context: A210533 A246435 A301461 * A373811 A046155 A026819
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Feb 04 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 August 18 05:18 EDT 2024. Contains 375255 sequences. (Running on oeis4.)