|
%I #5 Aug 14 2015 14:36:23
%S 1,1,1,1,1,1,1,1,1,1,2,2,3,4,5,2,6,2,7,2,8,2,9,2,10,2,11,2,12,2,3,3,4,
%T 13,5,6,7,3,8,3,9,3,10,3,11,3,12,3,13,3,4,4,5,14,6,14,7,8,9,4,10,4,11,
%U 4,12,4,13,4,14,4,5,5,6,15,7,15,8,15,9,10,11,5,12,5,13,5,14,5,15,5,6,6
%N a(0) = 1 and for n > 0: a(n) = number of indices 0 <= i <= n with A033307(i)=A033307(n), where A033307 is the sequence of decimal digits of Champernowne's constant 0.123456789101112131415...
%H Reinhard Zumkeller, <a href="/A065648/b065648.txt">Table of n, a(n) for n = 0..10000</a>
%o (Haskell)
%o a065648 n = a065648_list !! n
%o a065648_list = f (0 : a033307_list) $ take 10 $ repeat 1 where
%o f (d:ds) counts = y : f ds (xs ++ (y + 1) : ys) where
%o (xs, y:ys) = splitAt d counts
%o -- _Reinhard Zumkeller_, Aug 13 2015
%Y Cf. A033307, A065649, A065650.
%Y Cf. A256100.
%K base,nonn,look
%O 0,11
%A Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Nov 09 2001
%E Definition and offset adjusted to follow a later change of A033307. - _Reinhard Zumkeller_, Aug 13 2015
|
