100509

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Fibonacci numbers).at n=19A024872
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (F(2), F(3), F(4), ...).at n=18A024874
• C(2n-1,n-1) mod n^4.at n=20A099908
• a(n) = binomial(2*c-1, c-1) (mod c^4), where c is the n-th composite number.at n=11A298946
• Number of integer partitions of n whose length (number of parts) is equal to the sum of some submultiset.at n=46A367212