44278

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).at n=40A024604
• Number of maximal sets of partitions of n with property that all parts in all partitions in the set are distinct.at n=28A068598
• The i-th term of the generalized Fibonacci sequence [0,k,k,2k,3k,...] is given by the formula F(i) = round( k/sqrt(5) * phi^i ) provided i >= s(k); a(n) = smallest value of k such that s(k) = n.at n=21A111917
• Number of partitions with maximum rectangle <= n.at n=16A115725
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=21A163685
• Numbers k whose binary expansion is a substring of the binary expansion of binomial(k,2).at n=48A356537