login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056646 Square root of largest unitary square divisor of central binomial coefficient. 0
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, 2, 21, 21, 7, 14, 7, 14, 6, 3, 1, 2, 2, 1, 10, 5, 35, 140, 7, 14, 126, 63, 2, 1, 5, 20, 90, 45, 3, 12 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

FORMULA

a(n)=A000188[A001405(n)]/A055229[A001405(n)]= A056056(n)/A056059(n)

EXAMPLE

n=28, binomial[28,14]=2.2.2.3.3.3.5.5.17.19.23. The square root of its largest square divisor is 30, while the largest unitary analogue is a(28)=30/6=5.

CROSSREFS

A000188, A001405, A055229, A056056, A056059.

Sequence in context: A156582 A156953 A156881 * A056056 A136462 A060517

Adjacent sequences:  A056643 A056644 A056645 * A056647 A056648 A056649

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 09 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.