66550

Appears in sequences

• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= n/3.at n=31A047197
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-1)/3.at n=31A048009
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-2)/3.at n=31A048020
• a(n) = (n+1)^2*(n+2)^3*(n+3)/24.at n=9A108648
• a(n) = if n mod 2 = 1 then n^3*(n-1)^2/2 else n^5/2.at n=11A122658
• Number of 3-almostprimes <= 2^n.at n=17A127396
• a(n) = floor(1/{(10+n^4)^(1/4)}), where {}=fractional part.at n=54A184634
• Number of ways to write n as an ordered sum of 10 nonzero triangular numbers.at n=32A340955
• Square array A(n,k) = A341527(A246278(n,k)), read by falling antidiagonals; denominators of the columnwise first quotients of A341605/A341606.at n=24A341627
• For any number n with binary expansion Sum_{k = 1..m} 2^e_k (where 0 <= e_1 < ... < e_m), a(n) = Product_{k = 1..m} prime(1+e_k)^k (where prime(k) denotes the k-th prime number).at n=21A344530