25384

Appears in sequences

• Expansion of Product_{m>=1} (1-m*q^m)^19.at n=8A022679
• Number of incongruent restricted disjoint covering systems (IRDCS) of length n.at n=32A123298
• Partial sums of floor(n^3/3).at n=23A173707
• Number of permutations of 1..n such that |p(i)-p(i-1)|>= 4 for i>1.at n=11A179957
• Number of permutations of 1..2*n+5 with no adjacent elements within n in value.at n=3A179963
• Number of (n+2) X 3 binary arrays avoiding patterns 000 and 101 in rows and columns.at n=6A203084
• Number of (n+2)X9 binary arrays avoiding patterns 000 and 101 in rows and columns.at n=0A203090
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 101 in rows and columns.at n=21A203091
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 101 in rows and columns.at n=27A203091
• Number of tilings of a 6 X n rectangle using integer-sided rectangular tiles of area 6.at n=14A220124
• Number of (n+1)X(2+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=1A237170
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the lower median of every 2X2 subblock equal.at n=4A237175
• Numbers m such that A166133(m+1) = A166133(m)^2 - 1.at n=38A256703
• Triangle T(n,k) giving the number of permutations of 1..n with no adjacent elements within k in value, for n >= 2, 1 <= k <= floor(n/2).at n=28A322255
• Sum of the second largest parts of the partitions of n into 10 squarefree parts.at n=51A326636
• Number of maximal independent sets in the 3 X n king graph.at n=14A332348
• a(n) = Sum_{k=0..floor(2*n/5)} binomial(2*k+1,2*n-5*k).at n=24A392455