%I#2 2012年3月30日17:34:38
%S 0,0,1,0,1,1,2,4,0,13,7,8,0,14,12,22,28,0,15,19,48,79,76,0,16,
%电话28,92204290272,0,1,7,391604639001133880,1,8,52258940,
%电话:2404412845863328
%N基于递归的反对角三角序列:f(N,a)=a*f(N-1,a)+N*f(N-2,a)
%C行总和为:
%C{0,1,2,7,19,67,228,893,3583,15705,…}。
%F F(n,a)=a*F(n-1,a)+n*F(n-2,a);
%F t(n,m)=反对角线(F(n,a))
%e{0},
%e{0,1},
%e{0,1,1},
%e{0,1,2,4},
%e{0,1,3,7,8},
%e{0,1,4,12,22,28},
%e{0,1,5,19,48,79,76},
%电子{0,1,6,28,92,204,290,272},
%电子{0,1,7,39,160,463,900,1133,880},
%电子{0,1,8,52,258,940,2404,4128,4586,3328}
%t f[0,a_]:=0;f[1,a_]:=1;
%tf[n,a_]:=f[n,a]=a*f[n-1,a]+n*f[n-2,a];
%t m1=表格[f[n,a],{n,0,10},{a,1,11}];
%t表[表[m1[[m,n-m+1]],{m,1,n}],{n,1,10}];
%t压扁[%]
%K nonn,tabl,未经编辑
%0、9
%A _Roger L.Bagula,2010年2月7日
|