75592
domain: N
Appears in sequences
- Number of different triangles, squares and rectangles created when a square piece of paper is folded n times, the first time by a diagonal of the square and after by the median of the triangle.at n=10A096260
- Let [n] = {1,2,...,n}. Let G_n be the union of all closed line segments joining any two elements of [n] X [n] along a vertical or horizontal line, or along a line with slope +-1. Then a(n) = combined total of the number of (nondegenerate) triangles and rectangles for which all edges are subsets of G_n.at n=16A098921
- Indices of primes in A001630.at n=13A241660
- Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=5A299131
- Number of nX6 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=3A299133
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=39A299135
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=41A299135