A359393 a(n) is the number of times A025581(n-1) (runs of k..0) occur among terms a(1..n-1).

0, 0, 2, 1, 1, 2, 0, 2, 2, 3, 0, 1, 4, 3, 4, 0, 2, 2, 6, 3, 5, 1, 1, 2, 3, 7, 5, 5, 1, 1, 3, 2, 5, 8, 7, 5, 1, 2, 1, 5, 2, 5, 10, 9, 5, 1, 1, 2, 1, 8, 2, 5, 12, 12, 5, 1, 1, 2, 2, 1, 10, 2, 5, 15, 15, 5, 0, 2, 1, 2, 2, 1, 12, 2, 5, 19, 17, 6, 3, 0, 2, 1, 2, 2, 2, 13

Offset: 1

Author

Tamas Sandor Nagy, Dec 29 2022

Keywords

• nonn
• easy

Comments

An inventory sequence variation.

Examples

			The recorded terms of the sequence:
                Zero 0's thus far
                |    Zero 1's thus far
                |    |  Two 0's thus far
                |    |  |    One 2's thus far
                |    |  |    |  One 1's thus far
                |    |  |    |  |  Two 0's thus far
                |    |  |    |  |  |
This sequence:  0,   0, 2,   1, 1, 2, ...
      A025581:  0,   1, 0,   2, 1, 0, ...
		

Links

• Neal Gersh Tolunsky, Table of n, a(n) for n = 1..20000
• Kevin Ryde, PARI/GP Code

Crossrefs

Cf. A032531 (with runs increasing), A025581, A342585.

Programs

PARI

\\ See links.