id:A014681 - OEIS Search Results

Search: id:A014681

Displaying 1-1 of 1 results found.

page 1

Fix 0; exchange even and odd numbers.

+0
16

0, 2, 1, 4, 3, 6, 5, 8, 7, 10, 9, 12, 11, 14, 13, 16, 15, 18, 17, 20, 19, 22, 21, 24, 23, 26, 25, 28, 27, 30, 29, 32, 31, 34, 33, 36, 35, 38, 37, 40, 39, 42, 41, 44, 43, 46, 45, 48, 47, 50, 49, 52, 51, 54, 53, 56, 55, 58, 57, 60, 59, 62, 61, 64, 63, 66, 65, 68, 67, 70 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`A self-inverse permutation of the nonnegative numbers.` `If we ignore the first term 0, then this can be obtained as: a(n) is the smallest number not occurring earlier and coprime to n. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 16 2003`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	FORMULA	`G.f.: (2-x+x^2)/((1-x)*(1-x^2)) [ njas ].` `a(n) = n-(-1)^n = a(n-1)+a(n-2)-a(n-3) = a(n-2)+2 - Henry Bottomley (se16(AT)btinternet.com), Mar 29 2000` `a(0) = 0; a(2m+1) = 2m+2; for m > 0 a(2m) = 2m - 1. - George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 04 2001`
	MATHEMATICA	`Table[n - (-1)^n, {n, 1, 60} ]`
	CROSSREFS	`Composing this permutation with A065190 gives A065164.` `Equals 1 + A004442.` `Adjacent sequences: A014678 A014679 A014680 this_sequence A014682 A014683 A014684` `Sequence in context: A004560 A076981 A114285 this_sequence A103889 A137805 A096779`
	KEYWORD	`nonn,easy`
	AUTHOR	`Mohammad K. Azarian (ma3(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research