A255484 a(n) = Product_{k=0..n} prime(k+1)*(binomial(n,k) mod 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

Offset

0,1

Comments

A123098 is a much better version of this sequence.

Links

Chai Wah Wu, Table of n, a(n) for n = 0..510

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
def A255484(n):
    return reduce(mul, (0 if ~n & k else prime(k+1) for k in range(n+1))) # Chai Wah Wu, Feb 09 2016

Crossrefs

Cf. A123098, A255483.

Sequence in context: A122685 A109581 A056876 * A021797 A068959 A285849

Adjacent sequences: A255481 A255482 A255483 * A255485 A255486 A255487

Keyword

nonn

Author

N. J. A. Sloane, Feb 28 2015

Status

approved