A318920 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.

1, 5, 30, 225, 1800, 15000, 128572, 1125000, 10000000, 1, 81818181, 750000000, 6923076923, 64285714286, 600000000000, 5625000000000, 52941176470588, 500000000000000, 4736842105263158, 45000000000000000, 428571428571428572, 4090909090909090909

Offset

1,2

Links

Lars Blomberg, Table of n, a(n) for n = 1..1001

Example

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.
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

Crossrefs

Cf. A318919.

Sequence in context: A371544 A129695 A110521 * A363908 A167892 A345190

Adjacent sequences: A318917 A318918 A318919 * A318921 A318922 A318923

Keyword

nonn,base

Author

N. J. A. Sloane, Sep 06 2018

Extensions

a(7)-a(22) from Lars Blomberg, Apr 24 2019

Status

approved