login
A232096
a(n) = largest m such that m! divides 1+2+...+n; a(n) = A055881(A000217(n)).
9
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,3
LINKS
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]
PROG
(Scheme)
(define (A232096 n) (A055881 (A000217 n)))
CROSSREFS
A042963 gives the positions of ones and A014601 the positions of larger terms.
Sequence in context: A202449 A326613 A288627 * A250030 A316456 A370060
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 18 2013
STATUS
approved