|
%I #31 May 15 2021 06:16:33
%S 1,-1,-3,-20,66,4439,454420,4873175,-3803048954,-7320203267692,
%T -1403057989033446,6669491545211096686,78492109668913945526447,
%U 69591502229308312804788424,-6243846072108996200105800383026,-604234376454072219680822138902122079
%N Main diagonal of A292068.
%H Alois P. Heinz, <a href="/A292072/b292072.txt">Table of n, a(n) for n = 0..79</a>
%F a(n) = [x^n] Product_{k=1..n} 1/(1 + k^n*x^k).
%p b:= proc(n, i, k) option remember; (m->
%p `if`(m<n, 0, `if`(n=m, i!^k, b(n, i-1, k)+
%p `if`(i>n, 0, i^k*b(n-i, i-1, k)))))(i*(i+1)/2)
%p end:
%p g:= proc(n,k) option remember; `if`(n=0, 1,
%p -add(b(n-i$2, k)*g(i, k), i=0..n-1))
%p end:
%p a:= n-> g(n$2):
%p seq(a(n), n=0..15); # _Alois P. Heinz_, Sep 12 2017
%t b[n_, i_, k_] := b[n, i, k] = Function[m, If[m < n, 0, If[n == m, i!^k, b[n, i - 1, k] + If[i > n, 0, i^k*b[n - i, i - 1, k]]]]][i*(i + 1)/2];
%t g[n_, k_] := g[n, k] = If[n == 0, 1, -Sum[b[n-i, n-i, k]*g[i, k], {i, 0, n-1}]];
%t a[n_] := g[n, n];
%t Table[a[n], {n, 0, 15}] (* _Jean-François Alcover_, Jun 03 2018, after _Alois P. Heinz_ *)
%o (PARI) {a(n) = polcoeff(1/prod(k=1, n, 1+k^n*x^k+x*O(x^n)), n)}
%o (Python)
%o from sympy.core.cache import cacheit
%o from sympy import factorial as f
%o @cacheit
%o def b(n, i, k):
%o m=i*(i + 1)/2
%o return 0 if m<n else f(i)**k if n==m else b(n, i - 1, k) + (0 if i>n else i**k*b(n - i, i - 1, k))
%o @cacheit
%o def g(n, k): return 1 if n==0 else -sum([b(n - i, n - i, k)*g(i, k) for i in range(n)])
%o def a(n): return g(n, n)
%o print([a(n) for n in range(16)]) # _Indranil Ghosh_, Sep 14 2017, after Maple program
%Y Cf. A292190, A292194.
%K sign
%O 0,3
%A _Seiichi Manyama_, Sep 12 2017
|
