|
|
A255484
|
|
a(n) = Product_{k=0..n} prime(k+1)*(binomial(n,k) mod 2).
|
|
2
|
|
|
2, 6, 0, 210, 0, 0, 0, 9699690, 0, 0, 0, 0, 0, 0, 0, 32589158477190044730, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 525896479052627740771371797072411912900610967452630, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
A123098 is a much better version of this sequence.
|
|
LINKS
|
|
|
MAPLE
|
f:=n->mul(ithprime(k+1)*(binomial(n, k) mod 2), k=0..n);
[seq(f(n), n=0..60)];
|
|
PROG
|
(Python)
from operator import mul
from functools import reduce
from sympy import prime
return reduce(mul, (0 if ~n & k else prime(k+1) for k in range(n+1))) # Chai Wah Wu, Feb 09 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|