151878
domain: N
Appears in sequences
- Number of n-celled polygons with perimeter 2n on square lattice.at n=8A006726
- Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2*k.at n=38A008855
- G.f.: exp( Sum_{n>=1} 2^A090740(n) * x^n/n ) where A090740(n) = highest exponent of 2 in 3^n-1.at n=36A182000
- Triangle T(n,k), n>=1, 2<=k<=n+1, read by rows, where T(n,k) is the number of self-avoiding square-lattice polygons by area n and perimeter 2*k.at n=76A259857
- The number of steps for a knight to be trapped when moving on a spirally numbered hexagonal board to the lowest available unvisited cell and starting at cell n.at n=25A333683