A277674 a(n) = d(n+1) - d(n), where d(k) is the number of digits in the base-k representation of k!.

0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1

Offset

2

Links

Clark Kimberling, Table of n, a(n) for n = 2..10000

Example

k  base-k representation of k!
=  ===========================
2              10_2
3              20_3
4             120_4
5             440_5
6            3200_6
7           20460_7
8          116600_8
9          612700_9
a(8) = 0 because d(9) = d(8).

Mathematica

d = Differences@Array[Floor@Log[#, #!] &, 10000, 2]; (* Robert G. Wilson v, Oct 27 2016 *)

Crossrefs

Cf. A000142, A060151, A277675, A277676.

Sequence in context: A285351 A284893 A316829 * A309754 A112690 A316343

Adjacent sequences: A277671 A277672 A277673 * A277675 A277676 A277677

Keyword

nonn,base,easy

Author

Clark Kimberling, Oct 26 2016

Status

approved