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 A381609 #8 Mar 03 2025 09:33:12 %S A381609 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,2,2,2,2,1,1,1,1,2,1,1,1,1, %T A381609 1,1,1,2,1,1,1,1,2,2,2,2,1,1,1,1,2,1,1,1,1,2,2,2,3,2,2,2,2,3,2,2,2,1, %U A381609 1,1,1,2,1,1,1,1,2,2,2,2,1,1,1,1,2,1,1 %N A381609 a(n) is the number of occurrences of n in A381607. %C A381609 All terms are positive (see A381579). %H A381609 Rémy Sigrist, <a href="/A381609/b381609.txt">Table of n, a(n) for n = 0..10000</a> %H A381609 Rémy Sigrist, <a href="/A381609/a381609_1.gp.txt">PARI program</a> %F A381609 a(n) > 0. %e A381609 The number 8 appears twice in A381607, so a(8) = 2. %o A381609 (PARI) \\ See Links section. %Y A381609 Cf. A381579, A381607. %K A381609 nonn,base %O A381609 0,9 %A A381609 _Rémy Sigrist_, Mar 01 2025