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.

Showing 1-1 of 1 results.

A280716 Expansion of Product_{k>=2} (1 + mu(2*k-1)^2*x^(2*k-1)), where mu() is the Moebius function (A008683).

Original entry on oeis.org

1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 1, 3, 2, 3, 3, 3, 4, 4, 3, 5, 4, 5, 6, 4, 8, 6, 8, 8, 9, 11, 10, 11, 14, 13, 14, 15, 16, 19, 16, 20, 22, 22, 23, 26, 29, 30, 31, 35, 39, 38, 43, 44, 49, 50, 52, 58, 59, 64, 67, 71, 77, 82, 85, 93, 97, 107, 108, 117, 125, 131, 138, 143, 157, 162, 168, 179, 194, 199
Offset: 0

Views

Author

Ilya Gutkovskiy, Jan 07 2017

Keywords

Comments

Number of partitions of n into distinct odd squarefree parts > 1.

Examples

			a(18) = 3 because we have [15, 3], [13, 5] and [11, 7].
		

Crossrefs

Programs

  • Mathematica
    nmax = 84; CoefficientList[Series[Product[1 + MoebiusMu[2 k - 1]^2 x^(2 k - 1), {k, 2, nmax}], {x, 0, nmax}], x]

Formula

G.f.: Product_{k>=2} (1 + mu(2*k-1)^2*x^(2*k-1)).
Showing 1-1 of 1 results.