27782
domain: N
Appears in sequences
- Row sums of a Pascal-Fibonacci triangle.at n=13A114199
- Number of nX3 0..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=7A201096
- T(n,k)=Number of nXk 0..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=47A201101
- Number of nX3 arrays containing 3 copies of 0..n-1 with rows and columns nondecreasing.at n=7A265000
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with rows and columns nondecreasing.at n=52A265005
- G.f.: Sum_{k>=1} x^k/(1-x^k) * Product_{k>=1} (1+x^k)/(1-x^k).at n=19A305102
- a(n) = 3*n^3 - 1.at n=21A345701