21050

Appears in sequences

• Number of n-celled polygons with perimeter 2n+2 on square lattice.at n=9A006725
• 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=26A008855
• Numbers k such that k | 13^k + 1.at n=28A015963
• Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026703.at n=5A027255
• "DHK[ 5 ]" (bracelet, identity, unlabeled, 5 parts) transform of 1,1,1,1,...at n=42A032246
• Cumulative sum of quintuple factorial numbers n!!!!! (A085157).at n=19A114805
• a(n) = floor(n*(n+2)*(n+4)*(n-6)/192).at n=45A117652
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=8A151476
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=26A214563
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=21A214601
• Number of (n+4) X 7 0..1 matrices with each 5 X 5 subblock idempotent.at n=14A224685
• Number of partitions of n into distinct parts with boundary size 7.at n=42A227564
• 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=54A259857
• Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=5A260541
• Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=4A260542
• Number of rectangular plane partitions of n with strictly decreasing rows and columns.at n=45A323430