login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056056 Square root of largest square dividing n-th central binomial coefficient. 11
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = A000188(A001405(n)).
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 *)
PROG
(PARI) a(n) = b = binomial(n, n\2); sqrtint(b/core(b)); \\ Michel Marcus, Dec 10 2013
CROSSREFS
Sequence in context: A293785 A156881 A056646 * A136462 A320574 A060517
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 26 2000
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:08 EDT 2024. Contains 371906 sequences. (Running on oeis4.)