29561
domain: N
Appears in sequences
- a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=22A022863
- Number of different words that can be formed from an n X n grid of letters, reading horizontally, vertically or diagonally.at n=20A034720
- G.f.: q*Product_{k>0} (1-q^(12k))(1+q^(12k-1))(1+q^(12k-11))/(1-q^k).at n=35A098693
- Coefficients of a q-series inspired by Andrews and Ramanujan.at n=36A122928
- 38-gonal numbers: a(n) = n*(18*n-17).at n=41A282850
- Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A300202
- Number of n X 4 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A300204
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=24A300208