%I #9 Apr 25 2019 04:14:28
%S 1,5,30,225,1800,15000,128572,1125000,10000000,1,81818181,750000000,
%T 6923076923,64285714286,600000000000,5625000000000,52941176470588,
%U 500000000000000,4736842105263158,45000000000000000,428571428571428572,4090909090909090909
%N a(n) = number of times n appears in the sequence (b(i)[1], i=1,2,3,4,...), where b(i) is defined in A318919.
%H Lars Blomberg, <a href="/A318920/b318920.txt">Table of n, a(n) for n = 1..1001</a>
%e The sequence (b(i)[1], i=1,2,3,4,...) is 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, ... The present sequence gives the run lengths.
%e The term a(10)=1 because b()[1] increments from 9 to 10: [9,99999996], [9,100000005], [10,100000015], [11,100000026]. The same happens at n=100, 1000. - _Lars Blomberg_, Apr 24 2019
%Y Cf. A318919.
%K nonn,base
%O 1,2
%A _N. J. A. Sloane_, Sep 06 2018
%E a(7)-a(22) from _Lars Blomberg_, Apr 24 2019