Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160764
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160764 a(n) = n-th square-free number minus round(n*zeta(2)). +0
2
-1, -1, -2, -2, -2, -3, -2, -2, -2, -2, -3, -3, -2, -2, -3, -3, -2, -1, -1, -2, -2, -2, -3, -2, -3, -4, -3, -4, -5, -3, -4, -2, -1, -1, -1, -1, -2, -2, -2, -1, -1, -2, -2, -2, -3, -3, -3, -2, -3, -3, -2, -3, -2, -3, -3, -3, -3, -2, -3, -4, -3, -1, -2, -2, -2, -3, -3, -3, -4 (list; graph; listen)
OFFSET

1,3

COMMENT

Race between the n-th square-free number and round(n*zeta(2)).

LINKS

Daniel Forgues, Table of n, a(n) for n=1..60794

FORMULA

Since zeta(2) = Sum[{i, 1, inf}, {1/(i^2)}] = (pi^2)/6, we get:

a(n) = A005117(n) - n * Sum[{i, 1, inf}, {1/(i^2)}] = O(sqrt(n))

a(n) = A005117(n) - n * (pi^2)/6 = O(sqrt(n))

CROSSREFS

Cf. A005117 Square-free numbers.

Cf. A013929 Not square-free numbers.

Cf. A013928 Number of square-free numbers < n.

Cf. A158819 Number of square-free numbers <= n minus round(n/zeta(2)).

Sequence in context: A089367 A130192 A104564 this_sequence A156384 A064656 A056608

Adjacent sequences: A160761 A160762 A160763 this_sequence A160765 A160766 A160767

KEYWORD

sign

AUTHOR

Daniel Forgues (squid(AT)zensearch.com), May 26 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research