Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126761
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126761 {a(k)} is such that, for every positive integer n, the n-th prime = sum{1<=k<=n,GCD(k,n+1)=1} a(k). +0
1
2, 1, 3, 1, 9, -3, 3, 3, 15, -5, 17 (list; graph; listen)
OFFSET

1,1

LINKS

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

EXAMPLE

31 is the 11th prime. So 31 = sum{1<=k<=11,GCD(k,12)=1} a(k) = a(1)+a(5)+a(7)+a(11) = 2 +9 +3 +17.

CROSSREFS

Sequence in context: A140966 A058036 A136179 this_sequence A090559 A098570 A122048

Adjacent sequences: A126758 A126759 A126760 this_sequence A126762 A126763 A126764

KEYWORD

more,sign

AUTHOR

Leroy Quet Feb 22 2007

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research