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!)
A129253 Number of numbers not greater than n having at least one divisor p^e with p<=e, p prime. 1
0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

a(1) = 1, a(n+1) = if A129251(n+1)>0 then a(n-1)+1 else a(n-1).

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

CROSSREFS

Sequence in context: A257839 A075245 A328301 * A008652 A195120 A259506

Adjacent sequences:  A129250 A129251 A129252 * A129254 A129255 A129256

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 07 2007

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 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)