|
%I #16 Aug 06 2021 15:00:16
%S 66,249,1075,5133,26683,149410,894124,5683643,38186471,270054693,
%T 2003233849,15539557832,125727364954,1058517565329,9254401000167,
%U 83864649249661,786443164853871,7620060523287298,76182494678422156,784894262599538443,8323844770001318027,90767456208155581709
%N Column 3 of array in A322765.
%D D. E. Knuth, The Art of Computer Programming, Vol. 4A, Table A-1, page 778.
%H Seiichi Manyama, <a href="/A322768/b322768.txt">Table of n, a(n) for n = 0..500</a>
%o (PARI) T(n, k) = if(k==0, sum(j=0, n, stirling(n, j, 2)), (T(n+2, k-1)+T(n+1, k-1)+sum(j=0, k-1, binomial(k-1, j)*T(n, j)))/2);
%o vector(20, n, T(n-1, 3)) \\ _Seiichi Manyama_, Nov 21 2020
%Y Cf. A322765, A322774.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Dec 30 2018
|
