A triangle sequence from a sum: t0(n,m)=(2 + PartitionsQ[n] - PartitionsQ[m] - PartitionsQ[n - m]); t1(n,k)=Sum[(-1)^j *t0[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; t(n,m)=If[n == 0, 1, t1(n, k) + t1(n, n - k)].

A156130

A triangle sequence from a sum: t0(n,m)=(2 + PartitionsQ[n] - PartitionsQ[m] - PartitionsQ[n - m]); t1(n,k)=Sum[(-1)^j *t0[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]; t(n,m)=If[n == 0, 1, t1(n, k) + t1(n, n - k)].

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =4a(5) =4a(6) =53a(7) =28a(8) =28a(9) =53a(10) =246a(11) =138a(12) =102a(13) =138a(14) =246a(15) =4207a(16) =1775a(17) =814a(18) =814a(19) =1775a(20) =4207a(21) =60922a(22) =25758a(23) =10035a(24) =5654a(25) =10035a(26) =25758a(27) =60922a(28) =1114857a(29) =457387

External references