cp's OEIS Frontend

A362557 Start with first term 0, then add paired terms counting every preceding term up to the largest term so far and loop back to 0 after every pair has been counted.

%I A362557 #15 Jun 24 2023 16:52:08
%S A362557 0,1,0,1,1,2,0,3,1,1,2,1,3,3,0,6,1,2,2,3,3,1,6,4,0,8,1,4,2,5,3,2,4,1,
%T A362557 5,2,6,1,8,5,0,11,1,7,2,6,3,3,4,3,5,4,6,1,7,2,8,1,11,6,0,14,1,9,2,9,3,
%U A362557 5,4,5,5,6,6,2,7,3,8,2,9,2,11,1,14,7,0
%N A362557 Start with first term 0, then add paired terms counting every preceding term up to the largest term so far and loop back to 0 after every pair has been counted.
%C A362557 Same as A055186, except previous pairs from the same row are included in the count.
%e A362557 Write "0". There is now "1 0". Now there is "1 1". We can't find any terms greater than 1, so we recheck the sequence for 0s and find "2 0(s)". Listing these terms in the order read out loud yields the sequence "0, 1, 0, 1, 1, 2, 0, ...".
%o A362557 (PARI) seq(n)={my(L=List([0]), m=0, k=0); while(#L<n, my(c=#select(t->t==k, L)); if(c, listput(L,c); listput(L,k); m=max(m,c));  k=if(k==m, 0, k+1)); Vec(L)} \\ _Andrew Howroyd_, May 02 2023
%Y A362557 Cf. A217760, A055186, A342585.
%K A362557 nonn,look,easy
%O A362557 1,6
%A A362557 _Robin Powell_, Apr 24 2023