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.

A366524 Largest square divisor of n which is < sqrt(n), for n >= 2; a(1) = 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 4, 1, 9, 1, 4, 1, 1, 1, 4, 1, 1, 9, 4
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 11 2023

Keywords

Crossrefs

Programs

  • Mathematica
    Join[{1}, Table[Last[Select[Divisors[n], # < Sqrt[n] && IntegerQ[Sqrt[#]] &]], {n, 2, 100}]]
  • PARI
    a(n) = {my(m=1); fordiv(sqrtint(n/core(n)), d, if(d^4 < n, m=max(m,d))); m^2} \\ Andrew Howroyd, Oct 11 2023