id:A034684 - OEIS Search Results

Search: id:A034684

Displaying 1-1 of 1 results found.

page 1

If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = min { p_i^e_i }.

+0
12

1, 2, 3, 4, 5, 2, 7, 8, 9, 2, 11, 3, 13, 2, 3, 16, 17, 2, 19, 4, 3, 2, 23, 3, 25, 2, 27, 4, 29, 2, 31, 32, 3, 2, 5, 4, 37, 2, 3, 5, 41, 2, 43, 4, 5, 2, 47, 3, 49, 2, 3, 4, 53, 2, 5, 7, 3, 2, 59, 3, 61, 2, 7, 64, 5, 2, 67, 4, 3, 2, 71, 8, 73, 2, 3, 4, 7, 2, 79, 5, 81, 2, 83, 3, 5, 2, 3, 8, 89, 2, 7, 4 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(1) = 1; for n > 1, smallest unitary divisor of n that is larger than 1.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Cf. A020639, A006530, A034684, A028233, A034699, A053585.` `Cf. A034444, A034448, A052125.` `Sequence in context: A043265 A026362 A081811 this_sequence A028233 A066296 A053626` `Adjacent sequences: A034681 A034682 A034683 this_sequence A034685 A034686 A034687`
	KEYWORD	`nonn,nice,easy`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research