23995

Appears in sequences

• Number of collinear triples in a 3 X n rectangular grid.at n=37A057566
• 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, 1), (0, 0, -1), (1, 0, -1), (1, 1, 0)}.at n=9A148948
• Partial sums of A033485.at n=41A178855
• Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,1,0,0 for x=0,1,2,3,4.at n=18A197311
• Shifts 3 places left under Euler transform with a(0)=0 and a(n)=1 for n < 3.at n=22A218020
• Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571.at n=45A258001
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included).at n=15A258002
• Capped binary boundary codes for fusenes (all orientations and rotations included).at n=15A258012
• Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A303239
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=61A303242
• Number of 7Xn 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A303247