Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071127
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071127 Number of times there is a prime p < n such that 2n+p is prime. +0
2
0, 0, 0, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 2, 3, 2, 3, 4, 2, 4, 4, 2, 2, 5, 4, 2, 5, 5, 2, 6, 3, 3, 6, 4, 4, 5, 3, 5, 6, 4, 3, 6, 5, 3, 8, 3, 6, 8, 5, 5, 6, 4, 4, 7, 6, 2, 6, 4, 3, 11, 5, 4, 9, 5, 5, 9, 7, 6, 9, 6, 3, 10, 6, 4, 11, 7, 6, 10, 5, 9, 11, 5, 6, 12, 8, 5, 10, 6, 6, 13, 7, 6, 11, 8, 8, 11, 7, 8, 11 (list; graph; listen)
OFFSET

1,7

LINKS

T. D. Noe, Table of n, a(n) for n=1..10000

EXAMPLE

a(7)=2 because 14+3 and 14+5 are primes.

MATHEMATICA

For[lst={}; n=1, n<=100, n++, cnt=0; k=1; While[Prime[k]<n, If[PrimeQ[2n+Prime[k]], cnt++ ]; k++ ]; AppendTo[lst, cnt]]; lst

CROSSREFS

Cf. A071137.

Adjacent sequences: A071124 A071125 A071126 this_sequence A071128 A071129 A071130

Sequence in context: A105224 A143488 A047070 this_sequence A029381 A027926 A114730

KEYWORD

easy,nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), May 28 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research