A352570 A slightly compressed version of A352569: replace each string 1 followed by k 0's in A352569 by the number k.

2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 3, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 3, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2

Offset: 1

Author

N. J. A. Sloane, Apr 03 2022

Keywords

• nonn

Comments

In the first million terms of A352569 there are 479415 strings 10...0: 10 occurs 439329 times, 100 39025 times, 1000 1039 times, and 10000 22 times.

Crossrefs

Cf. A109812, A352569.