A general recursion triangle with third part a power triangle:m=2; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).
A157629
A general recursion triangle with third part a power triangle:m=2; Power triangle: f(n,k,m)=If[n*k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m*k + 1)*A(n - 1, k, m) + m*f(n, k, m)*A(n - 2, k - 1, m).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =10a(5) =1a(6) =1a(7) =43a(8) =43a(9) =1a(10) =1a(11) =148a(12) =590a(13) =148a(14) =1a(15) =1a(16) =469a(17) =5018a(18) =5018a(19) =469a(20) =1a(21) =1a(22) =1438a(23) =34047a(24) =91492a(25) =34047a(26) =1438a(27) =1a(28) =1a(29) =4351
External references
- oeis: A157629