id:A111565 - OEIS Search Results

Search: id:A111565

Displaying 1-1 of 1 results found.

page 1

Largest prime factor of prime power > 1 that divide the n-th composite number; or a(n) = 0 iff n-th composite number is equal to the product of distinct primes.

+0
1

2, 0, 2, 3, 0, 2, 0, 0, 2, 3, 2, 0, 0, 2, 5, 0, 3, 2, 0, 2, 0, 0, 0, 3, 0, 0, 2, 2, 2, 3, 0, 2, 7, 5, 0, 2, 3, 0, 2, 0, 0, 2, 0, 3, 2, 0, 0, 2, 0, 0, 3, 0, 5, 2, 0, 0, 2, 3, 0, 2, 0, 0, 0, 2, 3, 0, 2, 0, 0, 0, 2, 7, 3, 5, 0, 2, 0, 0, 3, 0, 0, 2, 0, 0, 2, 3, 0, 0, 2, 11, 0, 0, 2, 5, 3, 2, 0, 0, 2, 0, 0, 3 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(6) = 2 because C(6) = 12 = 3*2^2 and the largest prime factor of power 2^2 is 2.`
	CROSSREFS	`Sequence in context: A144217 A132814 A058623 this_sequence A141099 A127710 A137510` `Adjacent sequences: A111562 A111563 A111564 this_sequence A111566 A111567 A111568`
	KEYWORD	`nonn`
	AUTHOR	`Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Nov 17 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research