login
A359393
a(n) is the number of times A025581(n-1) (runs of k..0) occur among terms a(1..n-1).
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,3
COMMENTS
An inventory sequence variation.
LINKS
Kevin Ryde, PARI/GP Code
EXAMPLE
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, ...
PROG
(PARI) See links.
CROSSREFS
Cf. A032531 (with runs increasing), A025581, A342585.
Sequence in context: A177717 A155997 A326171 * A123223 A374191 A088226
KEYWORD
nonn,easy
AUTHOR
Tamas Sandor Nagy, Dec 29 2022
STATUS
approved