login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,4
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