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.

A318721 Number of strict relatively prime factorizations of n.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 2, 0, 1, 0, 1, 0, 4, 0, 0, 1, 1, 1, 2, 0, 1, 1, 2, 0, 4, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 2, 1, 2, 1, 1, 0, 6, 0, 1, 1, 0, 1, 4, 0, 1, 1, 4, 0, 4, 0, 1, 1, 1, 1, 4, 0, 2, 0, 1, 0, 6, 1, 1, 1
Offset: 1

Views

Author

Gus Wiseman, Sep 02 2018

Keywords

Comments

a(1) could be either 0 or 1.

Examples

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

Crossrefs

Programs

  • Mathematica
    strfacs[n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#1,d]&)/@Select[strfacs[n/d],Min@@#1>d&],{d,Rest[Divisors[n]]}]];
    Table[Length[Select[strfacs[n],GCD@@#==1&]],{n,50}]