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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060431 Number of cube-free numbers <= n. 3
1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 19, 20, 21, 21, 22, 23, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 33, 34, 34, 35, 36, 37, 38, 39, 40, 41, 41, 42, 43, 44, 45, 46, 46, 47, 47, 48, 49, 50, 51, 52, 53, 54, 54, 55, 56, 57, 58, 59, 60, 61, 61 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

I. M. Vinogradov, Elements of the Theory of Numbers,(in Russian), Moscow, 1981, p. 36.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,500

FORMULA

a(n)=Sum_{d>=1} mu(d)*floor(n/d^3), mu(d) = Moebius function A008683.

a(n) is asymptotic to (1/zeta(3))*n - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 13 2007

PROG

(PARI) a(n)=sum(k=1, n, moebius(k)*floor(n/k^3)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 13 2007

(PARI) { for (n=1, 500, a=sum(k=1, n, moebius(k)*floor(n/k^3)); write("b060431.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 05 2009]

CROSSREFS

Cf. A013928, A013937.

Sequence in context: A194260 A097043 A053759 * A124808 A017862 A155919

Adjacent sequences:  A060428 A060429 A060430 * A060432 A060433 A060434

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 06 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.