95305
domain: N
Appears in sequences
- 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, 0), (-1, 0, 1), (1, -1, -1), (1, 1, -1), (1, 1, 1)}.at n=9A149629
- a(n) = 66*n^2 + 1.at n=38A158689
- Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of two indistinguishable pieces P on an n X n board.at n=20A222308
- a(n) = n*(n + 1)*(13*n^2 + 13*n - 14)/24.at n=20A264888
- Numbers n such that 8*9^n - 1 is prime.at n=16A268356
- Expansion of Sum_{p prime, i>=1} x^(p^i)/(1 - x^(p^i)) / Product_{p prime, j>=1} (1 - x^(p^j)).at n=51A281616
- Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=7A299124
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=58A299128