id:A080388 - OEIS Search Results

Search: id:A080388

Displaying 1-1 of 1 results found.

page 1

a(n)=GCD[A001405(n+1), A001405(n)], greatest common divisor of 2 consecutive central binomial coefficients.

+0
8

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; listen)

	OFFSET	`1,5`
	MATHEMATICA	`Table[GCD[Binomial[w+1, Floor[w+1/2]], Binomial[w, Floor[w/2]]], {w, 1, 256}]`
	CROSSREFS	`Cf. A001405.` `Sequence in context: A159269 A009191 A114717 this_sequence A104308 A122377 A037827` `Adjacent sequences: A080385 A080386 A080387 this_sequence A080389 A080390 A080391`
	KEYWORD	`easy,nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Mar 12 2003`

page 1

Search completed in 0.011 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research