22652
domain: N
Appears in sequences
- Number of bipartite partitions of n white objects and 9 black ones.at n=9A002758
- Number of bipartite partitions of n white objects and n black ones.at n=9A002774
- Number of binary rooted trees with n nodes and height at most 8.at n=17A036591
- Number of bipartite partitions of ceiling(n/2) white objects and floor(n/2) black ones.at n=18A091437
- a(n) = A108462(A025487(n)).at n=31A108463
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=37A124140
- 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, 0), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149483
- a(n) = 686*n + 14.at n=32A157366
- Numbers k such that 10^(2*k+1)-8*10^k-1 is prime.at n=8A183184
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of partitions of (n,k) into a sum of pairs.at n=54A201376
- Number of (w,x,y,z) with all terms in {0,...,n} and distinct consecutive gap sizes.at n=12A212900
- k such that 10^(2*k+1)-j*10^k-1 is prime for some j = 1, 2, 4, 5, 7 or 8.at n=36A213881
- Triangular array of coefficients of polynomials p(n,k) defined in Comments.at n=22A248664
- Triangular array of coefficients of polynomials p(n,x) defined in Comments; these are the polynomials defined at A248664, but here the coefficients are written in the order of decreasing powers of x.at n=26A248665
- a(n) = prime(n+1)^2 - prime(n).at n=34A261465
- Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A303011
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=42A303016
- Number of 7Xn 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=2A303021
- Number of refinement-ordered pairs of strict integer partitions of n.at n=34A317142
- Numbers that cannot be expressed as the sum of one or more numbers without any repeated digits.at n=21A342080