id:A056670 - OEIS Search Results

Search: id:A056670

Displaying 1-1 of 1 results found.

page 1

Largest prime-factor of which the exponent exceeds 1 among prime factors of central binomial coefficient, C(n,[n/2]); largest non-unitary prime factor of A001405(n); or the maximal prime divisor of the largest square divisor(A056057(n)) of C(n,[n/2]).

+0
1

1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 2, 2, 2, 3, 3, 1, 2, 1, 2, 2, 2, 1, 2, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 7, 7, 7, 7, 7, 7, 3, 3, 1, 2, 2, 2, 5, 5, 7, 7, 7, 7, 7, 7, 3, 3, 5, 5, 5, 5, 3, 3, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)

	OFFSET	`1,6`
	EXAMPLE	`n=28,C(28,14)=2.2.2.3.3.7.7.13,29.31.41.43.47, so a(28)=7 n=342,C(342,171)=32*F, where F is square-free, so a(341)=2.`
	CROSSREFS	`A001405, A056175, A056057.` `Sequence in context: A129453 A129455 A067924 this_sequence A030189 A114162 A029264` `Adjacent sequences: A056667 A056668 A056669 this_sequence A056671 A056672 A056673`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 10 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research