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.

A050325 Number of factorizations into squarefree factors indexed by prime signatures: A050320(A025487).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 5, 1, 3, 2, 6, 1, 3, 2, 6, 1, 3, 9, 2, 15, 4, 6, 1, 3, 10, 2, 21, 4, 6, 1, 3, 10, 2, 22, 4, 16, 6, 1, 13, 3, 35, 5, 10, 2, 22, 4, 19, 6, 1, 14, 3, 52, 41, 5, 10, 2, 22, 4, 20, 6, 1, 14, 3, 83, 42, 5, 26, 10, 2, 66, 17, 22, 4, 20, 55, 6, 6, 1, 14, 3, 93
Offset: 1

Views

Author

Christian G. Bower, Oct 15 1999

Keywords

Crossrefs

Programs

  • Maple
    read(transforms):
    a050320 := BFILETOLIST("b050320.txt") :
    for n from 1 do
        a050325 := a050320[A025487(n)] ;
        printf("%d %d\n",n,a050325) ;
    end do: # R. J. Mathar, May 26 2017
  • Mathematica
    a050320 = Cases[Import["https://oeis.org/A050320/b050320.txt", "Table"], {, }][[All, 2]];
    lpe = {}; a025487 = {1};
    Do[pe = Sort[FactorInteger[n][[All, 2]]]; If[FreeQ[lpe, pe], AppendTo[lpe, pe]; AppendTo[a025487, n]], {n, 2, 10^4}];
    A050325[n_] := a050320[[a025487[[n]]]];
    Array[A050325, 83] (* Jean-François Alcover, Apr 06 2020 *)

Formula

a(n) = A050320(A025487(n)).