OFFSET

2,1

COMMENTS

For every positive integer k, the k-th triangular number T(k) = A000217(k) = k*(k+1)/2 can be written as the product of two comprime factors, f1 and f2, where f2 = 2*f1 +- 1; e.g.,

k T(k) f1 f2

- ---- -- --

1 1 = 1 * 1

2 3 = 1 * 3

3 6 = 2 * 3

4 10 = 2 * 5

Since f1 and f2 are coprime, T(k) is squarefree iff both f1 and f2 are squarefree. Every pair of consecutive triangular numbers shares either the factor f1 or f2, so if T(k) is nonsquarefree, then at least one of T(k-1) and T(k+1) must also be nonsquarefree. Thus, no "run" of exactly one nonsquarefree triangular number exists (so a(1) does not exist).

LINKS

Giovanni Resta, Table of n, a(n) for n = 2..29 (terms < 5*10^25)

EXAMPLE

The 30th through 33rd triangular numbers are

T(30) = 465 = 3 * 5 * 13 (squarefree),

T(31) = 496 = 2^4 * 31 (nonsquarefree),

T(32) = 528 = 2^4 * 3 * 11 (nonsquarefree), and

T(33) = 561 = 3 * 11 * 17 (squarefree),

so 496 begins a run of exactly two consecutive nonsquarefree triangular numbers. Since 496 is the smallest such triangular number, a(2) = 496.

CROSSREFS

KEYWORD

nonn

AUTHOR

Jon E. Schoenfield, Apr 04 2020

EXTENSIONS

Terms a(23) and beyond from Giovanni Resta, Apr 07 2020

STATUS

approved