Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085013
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085013 a(1) = 1; for n>1, a(n) = smallest prime > a(n-1) such that a(1)*...*a(n) + 2 is a prime. +0
4
1, 3, 5, 7, 13, 23, 29, 37, 43, 61, 73, 89, 137, 151, 167, 199, 269, 383, 397, 521, 619, 659, 739, 1217, 1307, 1613, 1741, 1847, 1873, 2039, 2473, 2521, 2531, 3011, 3391, 3637, 3793, 4201, 4751, 5039, 5879, 6299, 7307, 7829, 8243, 8933, 9781, 9829, 10069 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

a[1] = 1; a[n_] := a[n] = Block[{k = a[n - 1] + 2}, While[ !PrimeQ[k] || ! PrimeQ[ k * Times @@ Table[ a[i], {i, 1, n - 1}] + 2], k += 2]; k]; Table[ a[n], {n, 1, 49}]

CROSSREFS

Cf. A083566.

Sequence in context: A060274 A005235 A107664 this_sequence A164939 A125272 A127443

Adjacent sequences: A085010 A085011 A085012 this_sequence A085014 A085015 A085016

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 17 2003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research