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,1

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.

Links

Table of n, a(n) for n=1..117.

Crossrefs

Cf. A109812, A352569.

Sequence in context: A035181 A035151 A290536 * A277855 A136662 A023595

Adjacent sequences: A352567 A352568 A352569 * A352571 A352572 A352573

Keyword

nonn

Author

N. J. A. Sloane, Apr 03 2022

Status

approved