36075
domain: N
Appears in sequences
- From George Gilbert's marks problem: jumping 4 marks at a time (initial positions).at n=24A019595
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDU's starting at level 0.at n=26A135330
- Number of Dyck paths of semilength n with no UUDU's starting at level 0.at n=11A135336
- Number of (n+2)X(2+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=5A251676
- Number of (n+2)X(6+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=1A251680
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=22A251682
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4.at n=26A251682
- Number of ordered ways of writing n-th triangular number as a sum of n nonzero triangular numbers.at n=9A298858
- Numbers k such that A060648(k) is divisible by k.at n=5A307227
- Number of ways to write n as an ordered sum of 9 nonzero triangular numbers.at n=36A340954
- G.f. A(x) satisfies: A(x) = 1 + x*A(x)^2 / (A(x) - 2*x*A'(x)).at n=6A352236