A071960 Largest k >= 0 such that Product_{i=0..k} (n+i) divides n!.

0, 0, 0, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1

Offset

1,7

Comments

If a(n) > 0, a(n+1) = a(n) - 1.

Links

Jinyuan Wang, Table of n, a(n) for n = 1..1000

Formula

a(n) = A064778(n) - n.

Example

7*8*9*10 divides 7! hence a(7) = 3.

Prog

(PARI) for(n=1, 150, s=0; while(sum(i=1, s, n!%(n+i))==0, s++); print1(s-1, ", "))

Crossrefs

Cf. A064778.

Sequence in context: A242928 A214845 A366766 * A056898 A204065 A275281

Adjacent sequences: A071957 A071958 A071959 * A071961 A071962 A071963

Keyword

nonn,easy

Author

Benoit Cloitre, Jun 25 2002

Status

approved