Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102811
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102811 Least k such that, for j from 1 to n, 2*P(k+n-j)+3 are consecutive primes with P(i)= i-th prime. +0
1
1, 3, 44, 62178, 643266 (list; graph; listen)
OFFSET

1,2

EXAMPLE

For n = 1 2*P(1)+3=2*2+3=7 prime so a(1)=1 as P(1)=2

For n=2 2*P(3)+3=2*5+3=13 prime, 2*P(4)+3=2*7+3=17 prime consecutive to 13 so a(2)=3 as P(3)=5

CROSSREFS

Cf. A089009.

Adjacent sequences: A102808 A102809 A102810 this_sequence A102812 A102813 A102814

Sequence in context: A046946 A092545 A011916 this_sequence A103980 A101236 A117960

KEYWORD

hard,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Feb 26 2005

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 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research