id:A061598 - OEIS Search Results

Search: id:A061598

Displaying 1-1 of 1 results found.

page 1

Distance to the largest Catalan number which is less than, but divides the n-th Catalan number; i.e. a(n) gives minimum k (> 0) such that C_{n-k}|C_n.

+0
1

1, 1, 2, 2, 1, 4, 6, 5, 7, 8, 7, 8, 10, 11, 12, 13, 14, 12, 14, 12, 18, 19, 20, 22, 20, 22, 23, 24, 25, 26, 30, 27, 28, 29, 31, 32, 33, 34, 35, 36, 35, 36, 38, 39, 40, 41, 42, 38, 39, 43, 45, 46, 47, 49, 53, 54, 55, 55, 57, 55, 52, 53, 56, 61, 62, 60, 62, 62, 63, 64, 68, 64, 65 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`a(5) = 1 because C_4 (= 14) divides C_5 (= 42).`
	MAPLE	[seq(WCD(j), j=1..100)]; WCD := proc(n) local i; for i from n-1 by -1 to 0 do if(0 = (`mod`(Cat(n), Cat(i)))) then RETURN(n-i); fi; od; end; Cat := n -> (binomial(2*n, n)/(n+1));
	CROSSREFS	`Cf. A000108.` `Sequence in context: A091869 A112307 A111062 this_sequence A071946 A053495 A096747` `Adjacent sequences: A061595 A061596 A061597 this_sequence A061599 A061600 A061601`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Jun 13 2001`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research