|
%I #16 Jun 29 2019 01:40:08
%S 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,
%T 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,
%U 1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1
%N a(n) = d(n+1) - d(n), where d(k) is the number of digits in the base-k representation of k!.
%H Clark Kimberling, <a href="/A277674/b277674.txt">Table of n, a(n) for n = 2..10000</a>
%e k base-k representation of k!
%e = ===========================
%e 2 10_2
%e 3 20_3
%e 4 120_4
%e 5 440_5
%e 6 3200_6
%e 7 20460_7
%e 8 116600_8
%e 9 612700_9
%e a(8) = 0 because d(9) = d(8).
%t d = Differences@Array[Floor@Log[#, #!] &, 10000, 2]; (* _Robert G. Wilson v_, Oct 27 2016 *)
%Y Cf. A000142, A060151, A277675, A277676.
%K nonn,base,easy
%O 2
%A _Clark Kimberling_, Oct 26 2016
|
