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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035346 Let F(n)=Q(n)-P(n) be the Fortunate numbers (A005235); sequence gives n such that F(n)=p(n+1). 5
1, 2, 3, 6, 7, 8, 14, 16, 17, 21, 73, 801 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

S. W. Golomb, The evidence for Fortune's conjecture, Math. Mag. 54 (1981), 209-210.

LINKS

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

EXAMPLE

a(10) = 21 because A002110(21)+Prime[22] = 40729680599249024150621323549 = 2.3.5.....67.71.73 + 79 is prime.

CROSSREFS

Cf. A002110, A005235, A006862, A035345.

Sequence in context: A189013 A242940 A127330 * A030164 A066646 A215488

Adjacent sequences:  A035343 A035344 A035345 * A035347 A035348 A035349

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

The terms 21 and 73 were found by Labos Elemer, May 02 2000.

One more term from Ralf Stephan, Oct 20 2002

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 20 21:20 EST 2014. Contains 249754 sequences.