|
|
A286624
|
|
a(n) = (prime(1+n)*prime(n)) + prime(n) + 1.
|
|
7
|
|
|
9, 19, 41, 85, 155, 235, 341, 457, 691, 929, 1179, 1555, 1805, 2065, 2539, 3181, 3659, 4149, 4825, 5255, 5841, 6637, 7471, 8723, 9895, 10505, 11125, 11771, 12427, 14465, 16765, 18079, 19181, 20851, 22649, 23859, 25749, 27385, 29059, 31141, 32579, 34753, 37055, 38215, 39401, 42189, 47265, 50845, 52211
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
9 is the only perfect square in this sequence. - Altug Alkan, Jul 01 2017
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Array[(#1 #2) + #1 + 1 & @@ Prime[# + {0, 1}] &, 49] (* Michael De Vlieger, Mar 14 2021 *)
|
|
PROG
|
(Scheme)
(PARI) lista(nn) = forprime(p=2, nn, print1(p*(nextprime(p+1)+1)+1, ", ")); \\ Altug Alkan, Jul 01 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|