A general recursion sequence:m=8:Half tent function: f(n,m)== Min[1 + Floor[m/2], 1 + Floor[(n - m)/2]]; 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)*A(n - 2, k - 1, m).
A157453
A general recursion sequence:m=8:Half tent function: f(n,m)== Min[1 + Floor[m/2], 1 + Floor[(n - m)/2]]; 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)*A(n - 2, k - 1, m).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =19a(8) =19a(9) =1a(10) =1a(11) =188a(12) =630a(13) =188a(14) =1a(15) =1a(16) =1717a(17) =15258a(18) =15258a(19) =1717a(20) =1a(21) =1a(22) =15494a(23) =316047a(24) =762900a(25) =316047a(26) =15494a(27) =1a(28) =1a(29) =139495
External references
- oeis: A157453