31092
domain: N
Appears in sequences
- Number of bipartite partitions.at n=19A002767
- a(n) = [ a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ], for n >= 3.at n=41A022871
- a(n) is the smallest k such that prime(k), prime(k+1), ..., prime(k+n-1) all have 10 as a primitive root, but prime(k-1) and prime(k+n) do not.at n=7A060262
- Expansion of (1-x)/(1-x-2*x^2-2*x^3).at n=14A078006
- Number of distinct factorizations of 105*2^n.at n=17A093802
- Number of closed lambda-terms of size n with size 1 for the variables.at n=11A135501
- Expansion of ((1-x)/(1-2*x))^6.at n=8A169793
- Number of 6-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=13A187159
- Number of length n+4 0..3 arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=3A247922
- T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=18A247927
- Number of length 4+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=2A247931
- G.f. A(x) satisfies: x = A(x) * (1 + A(x)) * (1 - 3*A(x)).at n=6A250887
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 5 or 6 king-move adjacent elements, with upper left element zero.at n=9A304600
- Expansion of Sum_{k>=1} (-1 + Product_{j>=1} (1 + x^(k*j))/(1 - x^(k*j))).at n=24A320942