login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063378 Smallest number whose Sophie Germain degree (see A063377) is n. 1
4, 7, 3, 11, 5, 2, 89, 1122659, 19099919, 85864769, 26089808579, 665043081119, 554688278429, 4090932431513069, 95405042230542329 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Also known as Cunningham chains of length n of the first kind.

For each positive integer n, is there some integer with Sophie Germain degree of n?

LINKS

Table of n, a(n) for n=0..14.

Warut Roonguthai, Yves Gallot's Proth.exe and Cunningham Chains

EXAMPLE

Using f(x)=2x+1, 11 -> 23 -> 47 -> 95, which is composite; thus a(3)=11.

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; f[n_] := Block[{k = 2}, While[ Length[ NestWhileList[2# + 1 &, k, PrimeQ]] != n + 1, k = NextPrim[k]]; k]; Table[f[n], {n, 1, 8}]

CROSSREFS

Cf. A005384, A063377.

Sequence in context: A100127 A130204 A021215 * A201412 A272056 A020803

Adjacent sequences:  A063375 A063376 A063377 * A063379 A063380 A063381

KEYWORD

hard,more,nonn

AUTHOR

Reiner Martin (reinermartin(AT)hotmail.com), Jul 14 2001

EXTENSIONS

More terms from Jud McCranie, Jul 20 2001

Edited and extended by Robert G. Wilson v, Nov 21 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 11:02 EST 2016. Contains 278776 sequences.