login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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. 5
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; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..54.

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: A340559 A073674 A084722 * A109790 A290426 A211137

Adjacent sequences:  A083563 A083564 A083565 * A083567 A083568 A083569

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited and extended by Robert G. Wilson v, Jun 17 2003

Edited by N. J. A. Sloane, Nov 01 2008 at the suggestion of R. J. Mathar

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 29 07:28 EDT 2021. Contains 346340 sequences. (Running on oeis4.)