34586
domain: N
Appears in sequences
- Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).at n=14A079909
- Semiprimes of the form 2*(m^2 + m + 1) (implying that m^2 + m + 1 is a prime).at n=38A107317
- 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, -1), (0, 0, 1), (0, 1, 0), (1, -1, -1)}.at n=10A149818
- Deficient numbers whose aliquot sequence is deficient, abundant, deficient, ..., etc.at n=14A234970
- Numbers k such that (26*10^k - 107)/9 is prime.at n=25A275287
- Number of partitions of n containing no part i of multiplicity i.at n=42A276429
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n * (2 + 3*x*A(x)^n)^n.at n=7A300049
- Total number of blocks in all set partitions of [n] with alternating parity of elements.at n=11A305823
- E.g.f. A(x) satisfies A(x) = exp( x * A(x)^2 * (1 + A(x))/2 ).at n=5A372251
- Number of 2*n X 8 binary arrays with row sums 4 and column sums n, avoiding the patterns 010 and 101 in any row and column.at n=4A381554