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.
%I A359393 #21 Dec 19 2024 11:46:19 %S A359393 0,0,2,1,1,2,0,2,2,3,0,1,4,3,4,0,2,2,6,3,5,1,1,2,3,7,5,5,1,1,3,2,5,8, %T A359393 7,5,1,2,1,5,2,5,10,9,5,1,1,2,1,8,2,5,12,12,5,1,1,2,2,1,10,2,5,15,15, %U A359393 5,0,2,1,2,2,1,12,2,5,19,17,6,3,0,2,1,2,2,2,13 %N A359393 a(n) is the number of times A025581(n-1) (runs of k..0) occur among terms a(1..n-1). %C A359393 An inventory sequence variation. %H A359393 Neal Gersh Tolunsky, <a href="/A359393/b359393.txt">Table of n, a(n) for n = 1..20000</a> %H A359393 Kevin Ryde, <a href="/A359393/a359393.gp.txt">PARI/GP Code</a> %e A359393 The recorded terms of the sequence: %e A359393 Zero 0's thus far %e A359393 | Zero 1's thus far %e A359393 | | Two 0's thus far %e A359393 | | | One 2's thus far %e A359393 | | | | One 1's thus far %e A359393 | | | | | Two 0's thus far %e A359393 | | | | | | %e A359393 This sequence: 0, 0, 2, 1, 1, 2, ... %e A359393 A025581: 0, 1, 0, 2, 1, 0, ... %o A359393 (PARI) \\ See links. %Y A359393 Cf. A032531 (with runs increasing), A025581, A342585. %K A359393 nonn,easy %O A359393 1,3 %A A359393 _Tamas Sandor Nagy_, Dec 29 2022