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.

A321936 Number of integer partitions of n containing no 1's, prime powers, or squarefree numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 4, 0, 1, 0, 3, 0, 2, 0, 3, 1, 1, 0, 7, 0, 2, 0, 5, 0, 5, 0, 7, 1, 3, 0, 12, 0, 4, 2, 10, 1, 8, 0, 14, 2, 6, 0, 22, 1, 10, 3, 20, 1, 15, 0, 26, 5, 12, 2
Offset: 0

Views

Author

Gus Wiseman, Dec 11 2018

Keywords

Comments

Number of integer partitions of n using elements of A126706.

Examples

			The a(56) = 7 partitions:
  (56)
  (28,28)
  (36,20)
  (44,12)
  (20,18,18)
  (24,20,12)
  (20,12,12,12)
		

Crossrefs

Programs

  • Mathematica
    nn=100;
    ser=Product[If[n==1||PrimePowerQ[n]||SquareFreeQ[n],1,1/(1-x^n)],{n,nn}];
    CoefficientList[Series[ser,{x,0,nn}],x]