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.

A327659 Number of factorizations of A318978(n - 1), the n-th number that is 1 or whose prime indices have a common divisor > 1, into numbers > 1 satisfying the same conditions.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Sep 21 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers whose prime indices have a common divisor > 1 are listed in A318978.

Crossrefs

See link for additional cross-references.

Programs

  • Mathematica
    nn=100;
    facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&]],{d,Select[s,Divisible[n,#]&]}]];
    y=Select[Range[1000],GCD@@PrimePi/@First/@FactorInteger[#]!=1&];
    Table[Length[facsusing[Rest[y],n]],{n,y}]

Formula

a(n) = A001055(A318978(n - 1)).