32656
domain: N
Appears in sequences
- a(n) = T(2n,n-1), T given by A026780.at n=6A026782
- a(n) = greatest number in row n of array T given by A026780.at n=14A027246
- a(n) = n*(n^3 - n + 2)/2.at n=16A101374
- Row sums of A103691.at n=19A103692
- 10th-order Fibonacci numbers: a(n+1) = a(n)+...+a(n-9) with a(0) = ... = a(8) = 0, a(9) = 1.at n=25A122265
- If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 8. See A159741 for details.at n=8A159744
- Number of Dyck 2n-paths with all ascents of even length and all descents of odd length.at n=10A182530
- Number of free tree-like convex polyominoes with n cells.at n=15A204804
- A014486-indices for the compact representation of Beanstalk-tree, with the lesser numbers coming to the left hand side.at n=10A218781
- Euler transform of A065958.at n=11A301978
- Number of strings of Hebrew letters with a gematria value equal to n.at n=15A339073
- Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive.at n=43A340107