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!)
A026826 Number of partitions of n into distinct parts, the least being 5. 3
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 7, 7, 9, 10, 12, 13, 16, 17, 20, 23, 26, 29, 34, 38, 43, 49, 55, 62, 70, 79, 88, 100, 111, 125, 140, 157, 174, 196, 217, 243, 270, 301, 333, 372, 411, 457, 506, 561, 619, 687, 757, 837, 924, 1019, 1122 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,19

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = A025151(n-5), n>5. - R. J. Mathar, Jul 31 2008

G.f.: x^5*product_{j=6..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008

MAPLE

b:= proc(n, i) option remember;

      `if`(n=0, 1, `if`((i-5)*(i+6)/2<n, 0,

       add(b(n-i*j, i-1), j=0..min(1, n/i))))

    end:

a:= n-> `if`(n<5, 0, b(n-5$2)):

seq(a(n), n=0..80);  # Alois P. Heinz, Feb 07 2014

MATHEMATICA

b[n_, i_] := b[n, i] = If[n == 0, 1, If[(i-5)*(i+6)/2 < n, 0, Sum[b[n-i*j, i-1], {j, 0, Min[1, n/i]}]]]; a[n_] := If[n<5, 0, b[n-5, n-5]]; Table[a[n], {n, 0, 80}] (* Jean-Fran├žois Alcover, Jun 24 2015, after Alois P. Heinz *)

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A241826 A237979 A264591 * A025151 A026801 A185328

Adjacent sequences:  A026823 A026824 A026825 * A026827 A026828 A026829

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

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 May 28 03:04 EDT 2020. Contains 334671 sequences. (Running on oeis4.)