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 A306251 #14 Apr 03 2025 14:46:00 %S A306251 1,1,2,1,2,3,1,1,3,2,2,3,3,1,4,4,1,5,2,1,4,6,1,2,5,3,2,7,1,3,5,4,2,3, %T A306251 8,1,3,6,4,2,4,5,5,3,5,6,2,7,6,1,4,9,2,3,10,3,4,5,7,1,8,8,1,9,4,5,10, %U A306251 1,4,11,2,6,9,3,2,12,1,7,10,1,5,6,6,3,11 %N A306251 Ordinal transform of A306246. %C A306251 For any n > 0, a(n) is the number of occurrences of A306246(n) among A306246(1), ..., A306246(n). %H A306251 Rémy Sigrist, <a href="/A306251/b306251.txt">Table of n, a(n) for n = 1..10000</a> %H A306251 Rémy Sigrist, <a href="/A306251/a306251.png">Density plot of the first 10000000 terms</a> %o A306251 (PARI) o = vector(18); for (n=1, 85, if (n<=2, v=n, v=pp+p); [pp, p]=[p, o[1+v]++]; print1 (o[1+v] ", ")) %Y A306251 Cf. A306246. %K A306251 nonn,look %O A306251 1,3 %A A306251 _Rémy Sigrist_, Feb 01 2019