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.

A376554 Square root of largest unitary square divisor of binomial(n, floor(n/2)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 6, 1, 2, 2, 1, 3, 3, 1, 2, 1, 2, 2, 1, 1, 2, 10, 5, 10, 5, 3, 12, 3, 3, 1, 2, 5, 10, 10, 5, 3, 6, 2, 1, 2, 1, 5, 20, 15, 30, 42, 21, 14, 7, 7, 28, 2, 1, 1, 4, 1, 4, 4, 1, 21, 21, 7, 14, 7, 14, 6, 3, 1, 2, 2, 1, 10, 5, 35, 140, 7, 14
Offset: 0

Views

Author

Amiram Eldar, Sep 28 2024

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[EvenQ[e], p^(e/2), 1]; a[0] = a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[Binomial[n, Floor[n/2]]]; Array[a, 100, 0]
  • PARI
    a(n) = {my(f = factor(binomial(n, n\2))); prod(i = 1, #f~, if(f[i, 2]%2, 1, f[i, 1]^(f[i, 2]/2)));}

Formula

a(n) = A071974(A001405(n)).
a(n) = sqrt(A376553(n)).