|
Search: id:A083566
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
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 this_sequence A109790 A056761 A108347
Adjacent sequences: A083563 A083564 A083565 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
