A232096 a(n) = largest m such that m! divides 1+2+...+n; a(n) = A055881(A000217(n)).

1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 5, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 4, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 4, 4, 1, 1, 3, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 4, 2, 1, 1, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 1, 1, 2, 5, 1, 1, 3, 3, 1, 1, 3

Offset: 1

Author

Antti Karttunen, Nov 18 2013

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10080

Crossrefs

A042963 gives the positions of ones and A014601 the positions of larger terms.

Cf. also A232097, A076733, A232094, A232095, A232098.

Programs

Scheme

(define (A232096 n) (A055881 (A000217 n)))

Formula

a(n) = A055881(A000217(n)).

a(n) = A231719(A226061(n+1)). [Not a practical way to compute this sequence, but follows from the definitions]