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-2 of 2 results.

A280151 Expansion of Product_{k>=1} 1/(1 - floor(1/omega(2*k+1))*x^(2*k+1)), where omega() is the number of distinct prime factors (A001221).

Original entry on oeis.org

1, 0, 0, 1, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 23, 26, 29, 33, 37, 42, 46, 53, 58, 66, 74, 81, 91, 101, 113, 124, 139, 153, 169, 188, 207, 228, 252, 278, 304, 336, 369, 405, 444, 487, 533, 583, 640, 697, 763, 832, 908, 990, 1078, 1175, 1278
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 27 2016

Keywords

Comments

Number of partitions of n into odd prime powers (1 excluded).

Examples

			a(12) = 3 because we have [9, 3], [7, 5], [3, 3, 3, 3].
		

Crossrefs

Programs

  • Mathematica
    nmax = 67; CoefficientList[Series[Product[1/(1 - Floor[1/PrimeNu[2 k + 1]] x^(2 k + 1)), {k, 1, nmax}], {x, 0, nmax}], x]

Formula

G.f.: Product_{k>=1} 1/(1 - floor(1/omega(2*k+1))*x^(2*k+1)).

A352166 Number of partitions of n into distinct odd prime powers (1 included).

Original entry on oeis.org

1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 5, 4, 5, 6, 6, 6, 7, 8, 9, 9, 10, 12, 12, 13, 14, 16, 17, 17, 19, 21, 23, 23, 25, 28, 30, 31, 33, 37, 38, 40, 43, 47, 50, 52, 55, 60, 64, 66, 70, 76, 81, 83, 89, 96, 101, 105, 110, 119, 125, 130, 138, 147, 155, 161
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 06 2022

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 70; CoefficientList[Series[Product[(1 + Boole[(PrimePowerQ[k] || k == 1) && OddQ[k]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]

Formula

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