Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076472
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076472 Number of pairs (p,q) of successive primes with p+q<=n and gcd(p+q,n)>1. +0
3
0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 0, 2, 0, 2, 2, 2, 0, 3, 0, 4, 2, 3, 0, 4, 1, 4, 3, 4, 0, 6, 0, 5, 4, 5, 2, 6, 0, 6, 5, 7, 0, 7, 0, 7, 7, 7, 0, 7, 1, 8, 6, 8, 0, 8, 2, 8, 6, 8, 0, 10, 0, 9, 7, 9, 4, 9, 0, 10, 7, 11, 0, 10, 0, 10, 8, 10, 1, 11, 0, 12, 8, 11, 0, 12, 4, 12, 9, 12, 0, 14, 4, 13, 10, 13, 4, 13 (list; graph; listen)
OFFSET

1,10

COMMENT

a(n) = A076471(n) - A076473(n);

for n>6: a(n)=0 iff n is prime.

EXAMPLE

n=27: gcd(2+3,27)=1, gcd(3+5,27)=1, gcd(5+7,27)=3, gcd(7+11,27)=9, gcd(11+13,27)=3, hence a(27)=3.

CROSSREFS

Sequence in context: A116127 A039979 A103668 this_sequence A140302 A085341 A063918

Adjacent sequences: A076469 A076470 A076471 this_sequence A076473 A076474 A076475

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Oct 14 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research