id:A100113 - OEIS Search Results

Search: id:A100113

Displaying 1-1 of 1 results found.

page 1

a(n) = if n<=2 then n else (smallest square-free number m, not occurring earlier, and GCD(m,a(n-1))>1).

+0
3

1, 2, 6, 3, 15, 5, 10, 14, 7, 21, 30, 22, 11, 33, 39, 13, 26, 34, 17, 51, 42, 35, 55, 65, 70, 38, 19, 57, 66, 46, 23, 69, 78, 58, 29, 87, 93, 31, 62, 74, 37, 111, 102, 82, 41, 123, 105, 77, 91, 119, 85, 95, 110, 86, 43, 129, 114, 94, 47, 141, 138, 106, 53, 159, 165, 115, 130 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(A100112(n)) and A100114(A100112(n)) define a pair of inverse permutations of the square-free numbers: a(A100112(A100114(n))) = A100114(A100112(a(n))) = A005117(n);` `A100115(n) = if n is square-free then a(A100112(n)) else n.`
	LINKS	`Eric Weisstein's World of Mathematics, Squarefree`
	CROSSREFS	`Adjacent sequences: A100110 A100111 A100112 this_sequence A100114 A100115 A100116` `Sequence in context: A098810 A081469 A072647 this_sequence A094426 A094302 A094300`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 07 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research