19595

Appears in sequences

• Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= n/3.at n=17A047196
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n+1)/3.at n=17A048041
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n+2)/3.at n=17A048074
• Number of parts in all partitions of n in which every integer from the smallest part to the largest part occurs as a part.at n=38A117457
• a(n) = 25*n^2 - 5.at n=27A158446
• Number of partitions p of n such that median(p) < mean(p).at n=36A240217
• Number of partitions p of n such that (number of even numbers in p) <= 2*(number of odd numbers in p).at n=37A241642
• Number of set partitions C'_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks and such that no part contains both 1 and t (each unmarked) or both i and i+1 (each unmarked) for some i with 1 <= i < t; triangle C'_t(n), t>=0, 0<=n<=t, read by rows.at n=40A261319
• G.f. = b(2)*b(6)*b(10)/(x^14+x^12-x^5-x^3-x+1), where b(k) = (1-x^k)/(1-x).at n=18A266334
• Number of permutations sigma of [n] such that all values sigma(k)/k for 1 <= k <= n are pairwise distinct.at n=8A333082