|
%I #16 Oct 06 2022 04:30:29
%S 1,3,7,13,21,33,47,64,82,102,125,149,176,204,234,267,302,339,378,419,
%T 462,507,554,603,654,707,763,820,880,943,1008,1075,1143,1215,1288,
%U 1362,1437,1513,1592,1674,1757,1842,1928,2017,2107,2199,2293,2389,2487,2587,2690
%N Positions of 0's in A355917.
%C A355916(2*a(n)-1) = 0.
%H Michael De Vlieger, <a href="/A357370/b357370.txt">Table of n, a(n) for n = 1..10000</a>
%t 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]]
%o (Python)
%o from itertools import count, islice
%o from collections import Counter
%o def agen():
%o yield 1
%o num, alst, inventory = 0, [0, 0], Counter([0, 0])
%o for n in count(2):
%o c = [inventory[num], num]
%o num = 0 if c[0] == 0 else num + 1
%o if c[0] == 0: yield n
%o inventory.update(c)
%o print(list(islice(agen(), 51))) # _Michael S. Branicky_, Oct 05 2022
%Y Cf. A355916, A355917, A357371.
%K nonn
%O 1,2
%A _Michael De Vlieger_, Sep 25 2022
|
