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.

A304326 Number of ways to write n as a product of a number that is not a perfect power and a squarefree number.

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 0, 1, 3, 1, 3, 1, 3, 3, 0, 1, 3, 1, 3, 3, 3, 1, 2, 1, 3, 0, 3, 1, 7, 1, 0, 3, 3, 3, 3, 1, 3, 3, 2, 1, 7, 1, 3, 3, 3, 1, 2, 1, 3, 3, 3, 1, 2, 3, 2, 3, 3, 1, 7, 1, 3, 3, 0, 3, 7, 1, 3, 3, 7, 1, 3, 1, 3, 3, 3, 3, 7, 1, 2, 0, 3, 1, 7, 3, 3, 3, 2, 1
Offset: 1

Views

Author

Gus Wiseman, May 10 2018

Keywords

Examples

			The a(180) = 7 ways are (6*30), (12*15), (18*10), (30*6), (60*3), (90*2), (180*1).
		

Crossrefs

Positions of zeros are A246549. Range appears to be A075427.

Programs

  • Mathematica
    radQ[n_]:=And[n>1,GCD@@FactorInteger[n][[All,2]]===1];
    Table[Length[Select[Divisors[n],radQ[#]&&SquareFreeQ[n/#]&]],{n,100}]
  • PARI
    a(n)={sumdiv(n, d, d<>1 && !ispower(d) && issquarefree(n/d))} \\ Andrew Howroyd, Aug 26 2018