The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277674 a(n) = d(n+1) - d(n), where d(k) is the number of digits in the base-k representation of k!. 3
 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 (list; graph; refs; listen; history; text; internal format)
 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

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.

Last modified January 25 10:12 EST 2022. Contains 350565 sequences. (Running on oeis4.)