id:A100114 - OEIS Search Results

Search: id:A100114

Displaying 1-1 of 1 results found.

page 1

a(n) = the unique square-free m such that A100113(A100112(m))=A005117(n).

+0
3

1, 2, 5, 7, 3, 13, 10, 19, 23, 11, 6, 30, 41, 14, 17, 47, 26, 57, 15, 61, 21, 29, 34, 66, 39, 22, 71, 33, 87, 46, 94, 31, 102, 35, 42, 55, 110, 115, 62, 37, 43, 123, 51, 38, 139, 151, 65, 77, 53, 158, 70, 170, 82, 86, 58, 178, 78, 59, 93, 83, 190, 195, 69, 206, 74, 101, 213 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(A100112(n)) and A100113(A100112(n)) define a pair of inverse permutations of the square-free numbers: a(A100112(A100113(n))) = A100113(A100112(a(n))) = A005117(n);` `A100116(n) = if n is square-free then a(A100112(n)) else n.`
	LINKS	`Eric Weisstein's World of Mathematics, Squarefree`
	CROSSREFS	`Adjacent sequences: A100111 A100112 A100113 this_sequence A100115 A100116 A100117` `Sequence in context: A073929 A076555 A095928 this_sequence A078319 A098486 A138320`
	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 08:31 EDT 2008. Contains 144667 sequences.

AT&T Labs Research