A214856 Number of triangular numbers in interval ](n-1)^2, n^2] for n>0, a(0)=1.

1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1

Offset

0,5

Links

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Example

10, 15 are in interval ]9, 16] , a(4) = 2.

Prog

(PARI) a(n) = if (n, sum(i=(n-1)^2+1, n^2, ispolygonal(i, 3)), 1); \\ Michel Marcus, Nov 12 2022
(Python)
from math import isqrt
def A214856(n): return (isqrt((m:=n**2<<3)+8)+1>>1)-(isqrt(m-(n-1<<4))+1>>1) if n else 1 # Chai Wah Wu, Dec 09 2024

Crossrefs

Cf. A000217, A000290, A214848, A214857.

Sequence in context: A105690 A214364 A175922 * A006337 A214848 A006338

Adjacent sequences: A214853 A214854 A214855 * A214857 A214858 A214859

Keyword

nonn,easy

Author

Philippe Deléham, Mar 08 2013

Status

approved