Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,9

COMMENT

a(n) = A076471(n) - A076472(n).

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)=2.

CROSSREFS

Cf. A000010.

Sequence in context: A082023 A078152 A028932 this_sequence A163160 A029240 A025803

Adjacent sequences: A076470 A076471 A076472 this_sequence A076474 A076475 A076476

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research