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!)
A066030 Card{i<=n, floor(n/i)=0 mod(i)}. 1
1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 2, 2, 2, 1, 1, 3, 3, 3, 3, 3, 2, 1, 1, 2, 3, 2, 3, 4, 4, 1, 1, 3, 3, 2, 2, 4, 4, 3, 2, 3, 3, 1, 1, 2, 3, 2, 2, 3, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 2, 2, 1, 2, 5, 5, 3, 3, 3, 3, 2, 2, 4, 4, 3, 3, 4, 4, 2, 2, 3, 5, 4, 4, 3, 3, 2, 2, 3, 3, 2, 2, 3, 2, 1, 1, 3, 3, 3, 4, 6, 6, 4, 4, 5, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
(1/n)*Sum_{i=1..n} a(i) = C*log(n)+O(log(n)) with C = 0.5...
PROG
(PARI) for(n=1, 150, print1(sum(i=1, n, if(floor(n/i)%i, 0, 1)), ", "))
CROSSREFS
Sequence in context: A245424 A071784 A161638 * A025863 A346307 A339352
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 12 2001
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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)