25843

Appears in sequences

• Number of n X n binary arrays symmetric about the diagonal and under 90-degree rotation with all ones connected only either two adjacent vertically or two adjacent horizontally.at n=15A145778
• 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, 0), (-1, 0, 1), (0, 1, 1), (1, 0, -1)}.at n=10A148447
• 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, 0), (-1, 0, 1), (-1, 1, -1), (0, -1, 1), (1, 1, 0)}.at n=9A149186
• 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, -1, 0), (-1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=8A150366
• Number of ways to arrange 2 nonattacking knights on the lower triangle of an n X n board.at n=20A194486
• a(n) = n*(14*n - 1).at n=43A195024
• E.g.f. satisfies: A(x) = exp( 1/A(x)^2 * Integral A(x)^6 dx ).at n=6A232691
• Expansion of (1-q)^k/Product_{j=1..k} (1-q^j) for k=12.at n=44A275643
• Number of set partitions of [n] with alternating parity of elements and exactly three blocks.at n=14A305777
• Number of compositions of n with equal differences up to sign.at n=47A325557
• Numbers k such that s(k) = s(k+1), where s(k) is the unitary analog of the alternating sum-of-divisors function (A307037).at n=16A333408