cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A357370 Positions of 0's in A355917.

Original entry on oeis.org

1, 3, 7, 13, 21, 33, 47, 64, 82, 102, 125, 149, 176, 204, 234, 267, 302, 339, 378, 419, 462, 507, 554, 603, 654, 707, 763, 820, 880, 943, 1008, 1075, 1143, 1215, 1288, 1362, 1437, 1513, 1592, 1674, 1757, 1842, 1928, 2017, 2107, 2199, 2293, 2389, 2487, 2587, 2690
Offset: 1

Views

Author

Michael De Vlieger, Sep 25 2022

Keywords

Comments

A355916(2*a(n)-1) = 0.

Crossrefs

Programs

  • Mathematica
    nn = 51; c[_] = 0; i = 1; Reap[Do[k = 0; While[c[k] > 0, Set[m, c[k]]; c[m]++; c[k]++; i += 2; k++]; Set[m, c[k]]; c[m]++; c[k]++; Sow[(i + 1)/2]; i += 2, {n, nn}] ][[-1, -1]]
  • Python
    from itertools import count, islice
    from collections import Counter
    def agen():
        yield 1
        num, alst, inventory = 0, [0, 0], Counter([0, 0])
        for n in count(2):
            c = [inventory[num], num]
            num = 0 if c[0] == 0 else num + 1
            if c[0] == 0: yield n
            inventory.update(c)
    print(list(islice(agen(), 51))) # Michael S. Branicky, Oct 05 2022