id:A088823 - OEIS Search Results

Search: id:A088823

Displaying 1-1 of 1 results found.

page 1

a(n) = GCD of the sum of largest prime factors of numbers from 1 to n and of the sum of smallest prime factors of numbers from 1 to n.

+0
1

0, 2, 5, 7, 12, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 4, 1, 3, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 10, 1, 1, 1, 2, 29, 1, 1, 2, 1, 7, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 5, 1, 14, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n)=GCD[A088821(n), A088822(n)]`
	CROSSREFS	`Cf. A088821-A088825.` `Sequence in context: A038955 A131102 A039679 this_sequence A007445 A063217 A088821` `Adjacent sequences: A088820 A088821 A088822 this_sequence A088824 A088825 A088826`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Oct 22 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research