cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A059356 A diagonal of triangle in A008298.

This page as a plain text file.
%I A059356 #27 Apr 24 2021 09:53:54
%S A059356 1,9,59,450,3394,30912,293292,3032208,36290736,433762560,5925016800,
%T A059356 83648747520,1335385128960,20323375994880,376785057196800,
%U A059356 6493118120294400,132672192555571200,2513351450024755200,56577426980420505600,1188283280226545664000,29682641812682686464000,658094690655791972352000
%N A059356 A diagonal of triangle in A008298.
%D A059356 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 159.
%H A059356 Seiichi Manyama, <a href="/A059356/b059356.txt">Table of n, a(n) for n = 2..448</a>
%F A059356 a(n) = (n-1)! * Sum_{k=1..n-1} sigma(k)*sigma(n-k)/k = (n!/2) * Sum_{k=1..n-1} sigma(k)*sigma(n-k)/(k*(n-k)). - _Seiichi Manyama_, Nov 09 2020.
%F A059356 E.g.f.: (1/2) * log( Product_{k>=1} (1 - x^k) )^2. - _Ilya Gutkovskiy_, Apr 24 2021
%t A059356 nmax = 30; Table[n!/2 * Sum[DivisorSigma[1, k] * DivisorSigma[1, n-k] / k / (n-k), {k, 1, n-1}], {n, 2, nmax}] (* _Vaclav Kotesovec_, Nov 09 2020 *)
%o A059356 (PARI) {a(n) = my(t='t); n!*polcoef(polcoef(prod(k=1, n, (1-x^k+x*O(x^n))^(-t)), n), 2)} \\ _Seiichi Manyama_, Nov 07 2020
%o A059356 (PARI) {a(n)= (n-1)!*sum(k=1, n-1, sigma(k)*sigma(n-k)/k)} \\ _Seiichi Manyama_, Nov 09 2020
%o A059356 (PARI) {a(n)= n!*sum(k=1, n-1, sigma(k)*sigma(n-k)/(k*(n-k)))/2} \\ _Seiichi Manyama_, Nov 09 2020
%Y A059356 Cf. A000203, A000385, A008298.
%K A059356 nonn
%O A059356 2,2
%A A059356 _N. J. A. Sloane_, Jan 27 2001
%E A059356 More terms from _Vladeta Jovovic_, Dec 28 2001