122197
domain: N
Appears in sequences
- Numbers that are the sum of 9 positive 10th powers.at n=23A004809
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, 0)}.at n=9A150465
- Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207241
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=6A207245
- Number of n X n 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A299508
- Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A299512
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=60A299514
- a(n) = Sum_{d|n} d*binomial(d+2,3).at n=27A321598