Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056646
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056646 Square root of largest unitary square divisor of central binomial coefficient. +0
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, 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; listen)
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 this_sequence A056056 A136462 A060517

Adjacent sequences: A056643 A056644 A056645 this_sequence A056647 A056648 A056649

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research