33932
domain: N
Appears in sequences
- Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 7.at n=31A091778
- Expansion of q * psi(q^8) / phi(-q) in powers of q where psi(), phi() are Ramanujan theta functions.at n=25A123655
- Numbers k such that Sum_{i=1..k} i^9 divides Product_{i=1..k} i^9.at n=9A166609
- Number of 7 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=15A188558
- Number of ascents of length 1 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). An ascent is a maximal sequence of consecutive (1,1)-steps.at n=16A191386
- Number of 4-tuples (w,x,y,z) with all terms in {1,...,n} and w*x >= 2*y*z.at n=18A211809
- Sum over all peaks of Dyck paths of semilength n of the arithmetic mean of the x and y coordinates.at n=8A258431
- G.f. A(x) satisfies: A(x) = x + B(A(x))^2 such that B(x) = x + A(B(x))^3, where B(x) is the g.f. of A263533.at n=8A263532
- Number of 3-abelian equivalence classes of words of length n over a binary alphabet.at n=29A289657
- a(n) = 2^(n - 1) + binomial(n, floor(n/2))*(n + 1)/2.at n=14A323988