This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080388 a(n)=GCD[A001405(n+1), A001405(n)], greatest common divisor of 2 consecutive central binomial coefficients. 7
 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 6, 1, 2, 3, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 30, 1, 1, 3, 2, 5, 6, 1, 2, 3, 10, 1, 6, 1, 4, 15, 2, 1, 6, 1, 2, 3, 4, 1, 2, 1, 28, 1, 2, 1, 4, 1, 2, 7, 1, 1, 6, 1, 2, 3, 14, 1, 2, 1, 2, 1, 4, 7, 2, 1, 10, 1, 2, 1, 84, 5, 2, 3, 4, 1, 90, 7, 4, 3, 2, 5, 6, 1, 2, 9, 4, 1, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS MATHEMATICA Table[GCD[Binomial[w+1, Floor[w+1/2]], Binomial[w, Floor[w/2]]], {w, 1, 256}] CROSSREFS Cf. A001405. Sequence in context: A186728 A009191 A114717 * A104308 A175456 A122377 Adjacent sequences:  A080385 A080386 A080387 * A080389 A080390 A080391 KEYWORD easy,nonn AUTHOR Labos E. (labos(AT)ana.sote.hu), Mar 12 2003 STATUS approved

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 .