Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071416
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071416 GCD(n, binomial(2*n, n)). +0
2
1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 15, 2, 1, 6, 1, 20, 3, 2, 1, 12, 1, 2, 1, 28, 1, 2, 1, 2, 3, 2, 7, 4, 1, 2, 1, 20, 1, 42, 1, 4, 45, 2, 1, 12, 1, 2, 3, 4, 1, 6, 1, 8, 3, 2, 1, 12, 1, 2, 3, 2, 5, 66, 1, 4, 3, 10, 1, 36, 1, 2, 15, 4, 77, 6, 1, 20, 1, 2, 1, 28, 5, 2, 3, 88, 1, 10, 91, 4, 1, 2, 5 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)=n for n in A014847.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

a(10) = GCD(10, binomial(20, 10)) = GCD(10, 184756) = 2.

CROSSREFS

Cf. A000984.

Adjacent sequences: A071413 A071414 A071415 this_sequence A071417 A071418 A071419

Sequence in context: A102551 A086545 A126083 this_sequence A053589 A055770 A113766

KEYWORD

nonn,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 29 2002

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 October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research