|
|
A081411
|
|
Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).
|
|
4
|
|
|
1, 2, 4, 16, 32, 128, 256, 1024, 6144, 12288, 73728, 294912, 589824, 2359296, 14155776, 84934656, 169869312, 1019215872, 4076863488, 8153726976, 48922361856, 195689447424, 1174136684544, 9393093476352, 37572373905408, 75144747810816, 300578991243264, 601157982486528
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Original name was: Generated by recursion: a(n)=(Mod[Prime[n+1],Prime[n]]*n[n-1]; a[0]=1; Product of the first n consecutive prime-differences.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[1] = 1; a[n_] := a[n] = a[n - 1] * (Prime[n + 1] - Prime[n]); Array[a, 30] (* Amiram Eldar, Nov 19 2020 *)
|
|
PROG
|
(PARI) diff(v)=vector(#v-1, i, v[i+1]-v[i])
pprod(v)=my(t=1); vector(#v, i, t*=v[i])
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|