Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118580 Least k such that 10^n + k is a Sophie Germain prime and the lesser of a twin prime pair. +0
1
2, 1, 79, 19, 91, 361, 211, 1699, 1651, 2359, 3001, 26569, 61, 19759, 18109, 29911, 13741, 4381, 3811, 13429, 15469, 27331, 11431, 49111, 47929, 17041, 227971, 48979, 315511, 65299, 86359, 78049, 2449, 69949, 136579, 24781, 149779, 256171, 143551 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = A118479(n+1) - 10^n.

EXAMPLE

10^1+1=11, 11 is a Sophie Germain prime and 11 and 13 are twin prime pairs.

MATHEMATICA

f[n_] := Block[{k = 10^(n - 1)}, While[ !PrimeQ[k] || !PrimeQ[k + 2] || !PrimeQ[2k + 1], k++ ]; k - 10^(n - 1)]; Array[f, 40] (from Robert G. Wilson v (rgwv(at)rgwv.com), May 13 2006)

CROSSREFS

Cf. A118479.

Sequence in context: A104024 A096681 A067276 this_sequence A118558 A095837 A095835

Adjacent sequences: A118577 A118578 A118579 this_sequence A118581 A118582 A118583

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), May 07 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research