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!)
A214857 Number of triangular numbers in interval [0, n^2]. 4
1, 2, 3, 4, 6, 7, 9, 10, 11, 13, 14, 16, 17, 18, 20, 21, 23, 24, 25, 27, 28, 30, 31, 33, 34, 35, 37, 38, 40, 41, 42, 44, 45, 47, 48, 50, 51, 52, 54, 55, 57, 58, 59, 61, 62, 64, 65, 66, 68, 69, 71, 72, 74, 75, 76, 78, 79, 81, 82, 83, 85, 86, 88, 89, 91, 92, 93, 95, 96, 98, 99, 100 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Partial sums of A214856.
LINKS
FORMULA
a(n) = floor((1 + sqrt(1+8*n^2))/2). - Ralf Stephan, Jan 30 2014
EXAMPLE
0, 1, 3, 6 are in interval [0, 9], a(3) = 4.
0, 1, 3, 6, 10, 15 are in interval [0, 16], a(4) = 6.
MATHEMATICA
nn = 100; tri = Table[n (n + 1)/2, {n, 0, nn}]; Table[Count[tri, _?(# <= n^2 &)], {n, 0, Sqrt[tri[[-1]]]}] (* T. D. Noe, Mar 11 2013 *)
Table[Floor[(Sqrt[8*n^2+1]-1)/2]+1, {n, 0, 80}] (* Harvey P. Dale, Oct 14 2014 *)
CROSSREFS
Sequence in context: A059097 A047301 A186275 * A362443 A175320 A325597
KEYWORD
nonn,easy
AUTHOR
Philippe Deléham, Mar 09 2013
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 20 18:27 EDT 2024. Contains 372720 sequences. (Running on oeis4.)