A343880 Positions of 0's in A342585.

1, 4, 8, 14, 20, 28, 37, 46, 57, 69, 82, 95, 110, 125, 142, 159, 177, 196, 216, 238, 260, 285, 310, 335, 362, 390, 418, 448, 478, 511, 544, 578, 613, 648, 685, 722, 761, 800, 842, 884, 927, 971, 1018, 1065, 1112, 1161, 1210, 1259, 1309, 1361, 1413, 1467, 1521

Offset: 1

Author

Rémy Sigrist, May 02 2021

Keywords

• nonn

Comments

This sequence is infinite.

Examples

			A342585(8) = 0, so 8 belongs to the sequence.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000
• Rémy Sigrist, PARI program for A343880
• Rémy Sigrist, Colored scatterplot of (n, a(n+1)-a(n)) for n = 1..9999 (where the color is function of a(n+1)-a(n))

Crossrefs

Cf. A342585.

Programs

Mathematica

Position[Block[{c, k, m}, c[0] = 1; {0}~Join~Reap[Do[k = 0; While[IntegerQ[c[k]], Set[m, c[k]]; Sow[m]; If[IntegerQ@ c[m], c[m]++, c[m] = 1]; k++]; Sow[0]; c[0]++, 52]][[-1, -1]]], 0][[All, 1]] (* Michael De Vlieger, Oct 12 2021 *)

PARI

See Links section.

Python

from collections import Counter
def aupton(terms):
    num, A342585lst, inventory, alst, idx = 0, [0], Counter([0]), [1], 1
    while len(alst) < terms:
        idx += 1
        c = inventory[num]
        if c == 0:
            num = 0
            alst.append(idx)
        else:
            num += 1
        A342585lst.append(c)
        inventory.update([c])
    return alst
print(aupton(53)) # Michael S. Branicky, Oct 12 2021