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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083566 a(1) = 1; for n>1, a(n) = smallest odd number > a(n-1) such that a(1)*...*a(n) + 2 is a prime. 4
1, 3, 5, 7, 9, 15, 19, 25, 27, 53, 57, 65, 71, 87, 101, 151, 195, 247, 253, 255, 277, 289, 291, 301, 321, 355, 361, 443, 455, 461, 491, 531, 533, 541, 599, 603, 619, 635, 647, 667, 805, 817, 871, 1003, 1011, 1179, 1205, 1223, 1327, 1357, 1531, 1551, 1603, 1619 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A084723, A084724, A084725, A085013.

Sequence in context: A076188 A073674 A084722 * A109790 A056761 A108347

Adjacent sequences:  A083563 A083564 A083565 * A083567 A083568 A083569

KEYWORD

nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 13 2003

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 17 2003

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 01 2008 at the suggestion of R. J. Mathar

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

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

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.