The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282711 a(n) = number of terms of A003052 that are <= n. 1
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
U. Zannier, On the distribution of self-numbers, Proc. Amer. Math. Soc. 85 (1982), 10-14.
FORMULA
Zannier shows that a(n) = L*n + O(*log x)^2), where L is approximately 10.227...
MAPLE
# Assumes the array b52 contains a list of the terms in A003052.
p:=[]; t:=1; m:=b52[t]; c:=1;
for n from 1 to 1000 do
if n=m then c:=c+1; t:=t+1; m:=b52[t]; fi;
p:=[op(p), c];
od:
p;
CROSSREFS
Cf. A003052.
Sequence in context: A290323 A260254 A337853 * A035100 A303594 A085089
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 27 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 15:56 EDT 2024. Contains 372916 sequences. (Running on oeis4.)