cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A339103 Number of compositions (ordered partitions) of n into distinct parts >= 5.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 3, 3, 5, 5, 7, 7, 9, 15, 17, 23, 31, 37, 45, 57, 65, 101, 115, 151, 189, 255, 293, 383, 451, 565, 777, 921, 1157, 1469, 1855, 2311, 2865, 3495, 4313, 5231, 7063, 8269, 10509, 12849, 16217, 19829, 25171, 30031, 37485, 45183
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 23 2020

Keywords

Examples

			a(11) = 3 because we have [11], [6, 5] and [5, 6].
		

Crossrefs

Programs

  • Maple
    b:= proc(n, i, p) option remember;
          `if`(n=0, p!, `if`((i-4)*(i+5)/2 b(n$2, 0):
    seq(a(n), n=0..60);  # Alois P. Heinz, Nov 23 2020
  • Mathematica
    nmax = 54; CoefficientList[Series[Sum[k! x^(k (k + 9)/2)/Product[1 - x^j, {j, 1, k}], {k, 0, nmax}], {x, 0, nmax}], x]

Formula

G.f.: Sum_{k>=0} k! * x^(k*(k + 9)/2) / Product_{j=1..k} (1 - x^j).