login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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

Table of n, a(n) for n=1..92.

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: A262907 A290323 A260254 * A035100 A303594 A085089

Adjacent sequences:  A282708 A282709 A282710 * A282712 A282713 A282714

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)