id:A081210 - OEIS Search Results

Search: id:A081210

Displaying 1-1 of 1 results found.

page 1

In prime factorization of n replace each prime power p^e by the greatest square-free number <= p^e.

+0
6

1, 2, 3, 3, 5, 6, 7, 7, 7, 10, 11, 9, 13, 14, 15, 15, 17, 14, 19, 15, 21, 22, 23, 21, 23, 26, 26, 21, 29, 30, 31, 31, 33, 34, 35, 21, 37, 38, 39, 35, 41, 42, 43, 33, 35, 46, 47, 45, 47, 46, 51, 39, 53, 52, 55, 49, 57, 58, 59, 45, 61, 62, 49, 62, 65, 66, 67, 51, 69, 70, 71, 49, 73 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n)<=n and a(n)=n iff n is square-free (A005117);` `A081211(n)=a(a(n)), see A081212, A081213 and A081214 for iterations until a fix-point is reached.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000`
	FORMULA	`Multiplicative with p^e -> A070321(p^e), p prime.`
	CROSSREFS	`Sequence in context: A115350 A081211 A081213 this_sequence A070321 A036410 A008670` `Adjacent sequences: A081207 A081208 A081209 this_sequence A081211 A081212 A081213`
	KEYWORD	`nonn,mult`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 10 2003`

page 1

Search completed in 0.002 seconds

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.

AT&T Labs Research