|
%I #11 Dec 13 2023 08:51:26
%S 2,6,0,210,0,0,0,9699690,0,0,0,0,0,0,0,32589158477190044730,0,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,
%U 525896479052627740771371797072411912900610967452630,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N a(n) = Product_{k=0..n} prime(k+1)*(binomial(n,k) mod 2).
%C A123098 is a much better version of this sequence.
%H Chai Wah Wu, <a href="/A255484/b255484.txt">Table of n, a(n) for n = 0..510</a>
%p f:=n->mul(ithprime(k+1)*(binomial(n,k) mod 2),k=0..n);
%p [seq(f(n),n=0..60)];
%o (Python)
%o from operator import mul
%o from functools import reduce
%o from sympy import prime
%o def A255484(n):
%o return reduce(mul,(0 if ~n & k else prime(k+1) for k in range(n+1))) # _Chai Wah Wu_, Feb 09 2016
%Y Cf. A123098, A255483.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Feb 28 2015
|
