Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156314
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156314 Smallest prime p such that p mod prime(k+1) = prime(k) for exactly n distinct k. +0
2
2, 5, 23, 47, 283, 557, 5147, 2273, 12899, 103703 (list; graph; listen)
OFFSET

0,1

COMMENT

A156311(A049084(a(n)))=n and A156311(m)<n for m<A049084(a(n)).

EXAMPLE

a(9) = 103703 = A000040(9910), A156311(9910) = 9:

1: 2 + 3*34567 = prime(1) + prime(2)*34567 = 103703,

2: 3 + 5*20740 = prime(2) + prime(3)*20740 = 103703,

3: 5 + 7*14814 = prime(3) + prime(4)*14814 = 103703,

4: 19 + 23*4508 = prime(8) + prime(9)*4508 = 103703,

5: 131 + 137*756 = prime(32) + prime(33)*756 = 103703,

6: 163 + 167*620 = prime(38) + prime(39)*620 = 103703,

7: 181 + 191*542 = prime(42) + prime(43)*542 = 103703,

8: 751 + 757*136 = prime(133) + prime(134)*136 = 103703,

9: 20731 + 20743*4 = prime(2334) + prime(2335)*4 = 103703.

CROSSREFS

A156312.

Sequence in context: A141181 A100031 A126975 this_sequence A023186 A023188 A106858

Adjacent sequences: A156311 A156312 A156313 this_sequence A156315 A156316 A156317

KEYWORD

more,nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 07 2009

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research