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 A282711 #10 Nov 21 2024 05:16:23 %S A282711 1,1,2,2,3,3,4,4,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7, %T A282711 7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,10,10,10, %U A282711 10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12 %N A282711 a(n) is the number of terms of A003052 that are <= n. %H A282711 U. Zannier, <a href="http://www.ams.org/journals/proc/1982-085-01/S0002-9939-1982-0647887-4/">On the distribution of self-numbers</a>, Proc. Amer. Math. Soc. 85 (1982), 10-14. %F A282711 Zannier shows that a(n) = L*n + O((log x)^2), where L is approximately 10.227... %p A282711 # Assumes the array b52 contains a list of the terms in A003052. %p A282711 p:=[]; t:=1; m:=b52[t]; c:=1; %p A282711 for n from 1 to 1000 do %p A282711 if n=m then c:=c+1; t:=t+1; m:=b52[t]; fi; %p A282711 p:=[op(p),c]; %p A282711 od: %p A282711 p; %Y A282711 Cf. A003052. %K A282711 nonn %O A282711 1,3 %A A282711 _N. J. A. Sloane_, Feb 27 2017