Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080381
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080381 Triangle read by rows: GCD[C[n,Floor[n/2]],C[n,i], i=0,...n; greatest common divisor of binomial coefficients and corres ponding central binomial coefficient. +0
3
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 2, 6, 2, 1, 1, 5, 10, 10, 5, 1, 1, 2, 5, 20, 5, 2, 1, 1, 7, 7, 35, 35, 7, 7, 1, 1, 2, 14, 14, 70, 14, 14, 2, 1, 1, 9, 18, 42, 126, 126, 42, 18, 9, 1, 1, 2, 9, 12, 42, 252, 42, 12, 9, 2, 1, 1, 11, 11, 33, 66, 462, 462, 66, 33, 11, 11, 1, 1, 12, 66, 44, 33, 132 (list; table; graph; listen)
OFFSET

1,5

EXAMPLE

Triangle begins:

1

1 1

1 2 1

1 3 3 1

1 2 6 2 1

1 5 10 10 5 1

1 2 5 20 5 2 1

1 7 7 35 35 7 7 1

MATHEMATICA

Table[Table[GCD[Binomial[n, j], Binomial[n, Floor[n/2]]], {j, 0, n}], {n, 1, 10}]

CROSSREFS

Cf. A007318, A001405.

Sequence in context: A048804 A132422 A065133 this_sequence A080396 A027948 A095141

Adjacent sequences: A080378 A080379 A080380 this_sequence A080382 A080383 A080384

KEYWORD

nonn,tabl

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 12 2003

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research