27150
domain: N
Appears in sequences
- a(n) = floor(C(n,4)/5).at n=44A011795
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=40A051170
- Number of two-rowed partitions of length 6.at n=27A070559
- a(n) = n*Fibonacci(n) * Sum_{d|n} 1/(d*Fibonacci(d)).at n=16A203319
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3.at n=27A226411
- G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * x^n * (1 + x^n)^n.at n=34A326004
- Expansion of 1 / (1 - Sum_{i>=1} Sum_{j=1..i} x^(i*j)).at n=15A327739
- a(n) = Sum_k k*A333274(n,k).at n=13A333276