login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

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

Cf. A209037, A209038.

Sequence in context: A104502 A027343 A184644 * A182805 A309058 A218509

Adjacent sequences:  A209036 A209037 A209038 * A209040 A209041 A209042

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Mar 04 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 01:59 EDT 2021. Contains 345404 sequences. (Running on oeis4.)