Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070963 a(1) = 2; for n >= 2, n = sum{1<=k<n, GCD(k,n)=1} a(k). +0
1
2, 1, 2, 0, 4, -2, 0, 2, 6, -4, 6, -4, -6, 10, 2, -2, 12, -10, -2, 8, 2, -4, 8, 4, -16, 8, 10, -8, 10, -8, -8, 14, 14, -26, 26, -14, -36, 42, 20, -22, 68, -66, -60, 14, -10, 60, 40, -74, -38, -66, 10, 134, 44, -98, -64, -54, 22, 156, 20, -18, -34, -240, 10, 256, 32, -18, -6, -144, -72, 226, 70, -68, -50, -184, 58, 236, 82 (list; graph; listen)
OFFSET

1,1

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

12 = a(1) + a(5) + a(7) + a(11) = 2 + 4 + 0 + 6 because 1, 5, 7 and 11 are the positive integers < 12 and relatively prime to 12.

CROSSREFS

Sequence in context: A132456 A080966 A023895 this_sequence A139158 A055135 A121310

Adjacent sequences: A070960 A070961 A070962 this_sequence A070964 A070965 A070966

KEYWORD

sign

AUTHOR

Leroy Quet, May 16 2002

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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research