Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085906 Ramanujan sum c_6(n). +0
1
1, 1, 2, -2, -1, 2, -1, 0, -3, -1, -1, -4, -1, -1, -2, 0, -1, -3, -1, 2, -2, -1, -1, 0, 0, -1, 0, 2, -1, -2, -1, 0, -2, -1, 1, 6, -1, -1, -2, 0, -1, -2, -1, 2, 3, -1, -1, 0, 0, 0, -2, 2, -1, 0, 1, 0, -2, -1, -1, 4, -1, -1, 3, 0, 1, -2, -1, 2, -2, 1, -1, 0, -1, -1, 0, 2, 1, -2, -1, 0, 0, -1, -1, 4, 1, -1, -2, 0, -1, 3, 1, 2, -2, -1, 1, 0, -1, 0, 3, 0 (list; graph; listen)
OFFSET

1,3

REFERENCES

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976.

FORMULA

a(n) = phi(n)*mu(n/gcd(n, 6)) / phi(n/gcd(n, 6)).

PROGRAM

(PARI) a(n)=eulerphi(n)*moebius(n/gcd(n, 6))/eulerphi(n/gcd(n, 6))

CROSSREFS

Cf. A085639.

Sequence in context: A130071 A038540 A084348 this_sequence A090406 A152723 A137454

Adjacent sequences: A085903 A085904 A085905 this_sequence A085907 A085908 A085909

KEYWORD

sign,mult

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 16 2003

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 18 2003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research