22512
domain: N
Appears in sequences
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 25.at n=5A031703
- 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, 0, 1), (-1, 1, 1), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=10A148211
- 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), (0, -1), (1, -1), (1, 0), (1, 1)}.at n=10A151461
- a(n) = 625*n^2 + 2*n.at n=5A158382
- Number of (n+2)X6 binary matrices with every 3X3 block having exactly four 1's.at n=4A181258
- Number of (n+2)X7 binary matrices with every 3X3 block having exactly four 1's.at n=3A181259
- T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=31A181262
- T(n,k) = number of (n+2) X (k+2) binary matrices with every 3 X 3 block having exactly four 1's.at n=32A181262
- Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=36A184633
- Number of labeled rooted trees on n nodes such that each internal node has an odd number of children.at n=7A216187
- Number of (4n-3)-digit 4th powers in carryless arithmetic mod 10.at n=4A225107
- a(n) = Sum_{k=0..n} |Stirling1(n, k)|*(n-k)! for n>=0.at n=6A248028
- Number of partitions of n unlabeled objects of 8 colors.at n=5A270241
- Number of nX3 0..1 arrays with every element unequal to 0, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=13A304947
- Numbers with no 0 digit that are divisible by the sum of any two of their digits at distinct positions.at n=41A308561
- Expansion of 1/(1 - 4*x - 4*x^2)^(5/2).at n=5A374511
- a(n) = Sum_{k=0..floor(n/2)} binomial(n,k) * binomial(4*k,n-2*k).at n=9A389151
- Square array A(n,k) = A388978(A388981(n, k)), read by descending antidiagonals.at n=5A389168