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.

A320732 Number of factorizations of n into primes or semiprimes.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 3, 1, 4, 1, 3, 2, 2, 2, 6, 1, 2, 2, 4, 1, 4, 1, 3, 3, 2, 1, 5, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 7, 1, 2, 3, 4, 2, 4, 1, 3, 2, 4, 1, 7, 1, 2, 3, 3, 2, 4, 1, 5, 3, 2, 1, 7, 2, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Oct 20 2018

Keywords

Examples

			The a(60) = 5 factorizations are (2*2*3*5), (2*2*15), (2*3*10), (2*5*6), (3*4*5), (4*15), (6*10).
		

Crossrefs

Programs

  • Mathematica
    psemfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[psemfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],PrimeOmega[#]<=2&]}]];
    Table[Length[psemfacs[n]],{n,100}]