46377

Appears in sequences

• G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.at n=30A073570
• Number of partitions of n into deficient numbers.at n=44A097797
• Number of partitions of the n-th deficient number into deficient numbers.at n=34A097799
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k valleys.at n=50A101282
• a(n) = 1 + (6 + (11 + (6 + n)*n)*n)*n/24.at n=31A145126
• Number of lattice paths from (0,0) to (n,0) that do not go below the x-axis and consist of steps U=(1,1), D=(1,-1) and H=(1,0), where H-steps are only allowed if y=1.at n=17A224747
• Number of (n+1)X(2+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock equal.at n=3A236740
• Number of (n+1)X(4+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock equal.at n=1A236742
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock equal.at n=11A236746
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock equal.at n=13A236746
• a(n) = (n/2) * (n^3 - 2*n^2 - 2*n + 5).at n=18A242983
• Number of equivalence classes of ballot paths of length n for the string ddu.at n=31A274112
• Number of n X 3 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=22A281710
• Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^(3*k))/(1 - x^k).at n=41A304630
• Number of parts in all partitions of 2n with largest multiplicity n.at n=31A320381
• a(n) = Sum_{d|n} (-1)^(n/d-1) * binomial(d+3,4).at n=30A366814
• Expansion of (1/x) * Series_Reversion( x * ((1-x)^5-x^5) ).at n=5A368011
• Number of Schröder paths of semilength 2n and having n valleys.at n=5A385299
• a(n) = Sum_{k=0..floor(2*n/5)} (k+1) * binomial(k,2*n-5*k).at n=38A392268