cp's OEIS Frontend

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

%I A355918 #15 Sep 25 2022 14:37:37
%S A355918 0,1,3,5,7,11,13,16,17,19,22,23,26,27,29,32,34,36,38,40,42,44,46,48,
%T A355918 50,52,55,56,59,62,64,66,67,71,72,73,74,75,78,81,82,84,85,88,89,91,93,
%U A355918 95,97,99,102,103,106,108,109,111,113,115,117,119,121,123,125
%N A355918 Highest index in n-th inventory in A355916 and A355917.
%H A355918 Michael S. Branicky, <a href="/A355918/b355918.txt">Table of n, a(n) for n = 1..10000</a>
%H A355918 Rémy Sigrist, <a href="/A355918/a355918.txt">C program</a>
%o A355918 (C) See Links section.
%o A355918 (Python)
%o A355918 from collections import Counter
%o A355918 from itertools import count, islice
%o A355918 def agen():
%o A355918     num, inventory = 0, Counter([0, 0])
%o A355918     yield 0
%o A355918     for k in count(2):
%o A355918         c = [inventory[num], num]
%o A355918         if c[0] == 0: yield num; num = 0
%o A355918         else: num = num + 1
%o A355918         inventory.update(c)
%o A355918 print(list(islice(agen(), 63))) # _Michael S. Branicky_, Sep 25 2022
%Y A355918 Cf. A355916, A355917.
%K A355918 nonn
%O A355918 1,3
%A A355918 _N. J. A. Sloane_, Sep 24 2022
%E A355918 More terms from _Rémy Sigrist_, Sep 25 2022