A355918 Highest index in n-th inventory in A355916 and A355917.

0, 1, 3, 5, 7, 11, 13, 16, 17, 19, 22, 23, 26, 27, 29, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 55, 56, 59, 62, 64, 66, 67, 71, 72, 73, 74, 75, 78, 81, 82, 84, 85, 88, 89, 91, 93, 95, 97, 99, 102, 103, 106, 108, 109, 111, 113, 115, 117, 119, 121, 123, 125

Offset

1,3

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Rémy Sigrist, C program

Prog

(C) See Links section.
(Python)
from collections import Counter
from itertools import count, islice
def agen():
    num, inventory = 0, Counter([0, 0])
    yield 0
    for k in count(2):
        c = [inventory[num], num]
        if c[0] == 0: yield num; num = 0
        else: num = num + 1
        inventory.update(c)
print(list(islice(agen(), 63))) # Michael S. Branicky, Sep 25 2022

Crossrefs

Cf. A355916, A355917.

Sequence in context: A117203 A081118 A363583 * A003255 A263321 A244365

Adjacent sequences: A355915 A355916 A355917 * A355919 A355920 A355921

Keyword

nonn

Author

N. J. A. Sloane, Sep 24 2022

Extensions

More terms from Rémy Sigrist, Sep 25 2022

Status

approved