67330

Appears in sequences

• Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.at n=24A054206
• 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, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=9A149402
• Number of (n+1)X(n+1) 0..3 arrays with no 2X2 subblock summing to less than 6.at n=1A184664
• Number of (n+1)X3 0..3 arrays with no 2X2 subblock summing to less than 6.at n=1A184666
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock summing to less than 6.at n=4A184673
• Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A207759
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=4A207767