login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

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.

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

Sequence in context: A172130 A202449 A288627 * A250030 A316456 A083716

Adjacent sequences:  A232093 A232094 A232095 * A232097 A232098 A232099

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 09:52 EDT 2019. Contains 322472 sequences. (Running on oeis4.)