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.

A056056 Square root of largest square dividing n-th central binomial coefficient.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 3, 6, 1, 2, 2, 2, 3, 3, 1, 2, 1, 2, 2, 2, 1, 2, 10, 10, 30, 30, 6, 12, 3, 3, 3, 6, 5, 10, 10, 10, 3, 6, 2, 2, 2, 2, 30, 60, 15, 30, 42, 42, 42, 42, 14, 28, 2, 2, 2, 4, 2, 4, 4, 4, 21, 21, 7, 14, 7, 14, 6, 6, 1, 2, 2, 2, 10, 10, 70, 140, 7, 14, 126, 126, 6, 6, 30, 60
Offset: 1

Views

Author

Labos Elemer, Jul 26 2000

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Sqrt@ Max@ Select[Divisors@ Binomial[n, Floor[n/2]], IntegerQ@ Sqrt@ # &], {n, 0, 86}] (* Michael De Vlieger, Jul 04 2016 *)
    a[n_] := Times @@ (First[#]^Floor[Last[#]/2] & /@ FactorInteger[Binomial[n, Floor[n/2]]]); Array[a, 100] (* Amiram Eldar, Sep 06 2020 *)
  • PARI
    a(n) = b = binomial(n, n\2); sqrtint(b/core(b)); \\ Michel Marcus, Dec 10 2013

Formula

a(n) = A000188(A001405(n)).