login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A209039
Number of partitions of n into parts not less than max(1,n/5).
3
1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 12, 14, 21, 24, 34, 17, 21, 25, 33, 39, 24, 27, 34, 39, 50, 30, 36, 42, 50, 58, 40, 44, 53, 60, 71, 48, 56, 63, 73, 83, 60, 66, 77, 85, 99, 71, 80, 89, 102, 113, 85, 93, 106, 116, 132, 98, 110, 121, 135, 149, 116, 125, 140
OFFSET
0,3
LINKS
PROG
(Haskell)
a209039 n = p (max 1 (n `div` 5)) n where
p _ 0 = 1
p k m = if m < k then 0 else p k (m - k) + p (k + 1) m
CROSSREFS
Sequence in context: A104502 A027343 A184644 * A182805 A309058 A218509
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 04 2012
STATUS
approved