|
%I #9 Jul 11 2019 16:31:17
%S 26,6,6,76,14,12,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,712,38,280,
%T 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
%U 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6
%N Split the sequence A247476 into nonempty chunks of minimal length such that for d = 1..9, the number of terms with leading digit d is even; a(n) is the length of the n-th chunk.
%C This sequence corresponds to the first difference of A309063.
%H Rémy Sigrist, <a href="/A309073/b309073.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A309073/a309073.png">Illustration of first terms</a>
%F a(n) = A309063(n+1) - A309063(n).
%F a(n) = A055642(A309072(n)).
%e See illustration of first terms in Links section.
%Y Cf. A247476, A309063, A309072.
%K nonn,base
%O 1,1
%A _Rémy Sigrist_, Jul 10 2019
|
