30418
domain: N
Appears in sequences
- Number of solutions to c(1)t(1) + ... + c(n)t(n) = 0, where c(i) = +-1 for i>1, c(1) = t(1) = 1, t(i) = triangular numbers (A000217).at n=25A058498
- a(n) = floor(n*(n^3-n-3)/(2*(n-1))).at n=37A117561
- Partial sums of A032598.at n=17A129330
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00001001 or 00100101.at n=6A260978
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00001001 or 00100101.at n=5A260979
- Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.at n=26A308682
- On a diagonally numbered square grid, with labels starting at 1, this is the number of the last cell that a (1,n) leaper reaches before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=36A352731