id:A116922 - OEIS Search Results

Search: id:A116922

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest integer >= n/2 which is coprime to n.

+0
2

1, 1, 2, 3, 3, 5, 4, 5, 5, 7, 6, 7, 7, 9, 8, 9, 9, 11, 10, 11, 11, 13, 12, 13, 13, 15, 14, 15, 15, 17, 16, 17, 17, 19, 18, 19, 19, 21, 20, 21, 21, 23, 22, 23, 23, 25, 24, 25, 25, 27, 26, 27, 27, 29, 28, 29, 29, 31, 30, 31, 31, 33, 32, 33, 33, 35, 34, 35, 35, 37, 36, 37, 37, 39, 38 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`A116921(n) + A116922(n) = n. For n>= 3, A116922(n) - A116921(n) is 1 if n is odd, is 2 if n is a multiple of 4, and is 4 if n is congruent to 2 (mod 4).`
	FORMULA	`For n >= 3, a(n) = (n+1)/2 if n is odd, a(n) = n/2 + 1 if n is a multiple of 4, and a(n) = n/2 + 2 if n is congruent to 2 (mod 4).`
	CROSSREFS	`Cf. A116921.` `Sequence in context: A122954 A126571 A080391 this_sequence A086898 A123031 A088241` `Adjacent sequences: A116919 A116920 A116921 this_sequence A116923 A116924 A116925`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Feb 26 2006`
	EXTENSIONS	`More terms from Wyatt Lloyd (wal118(AT)psu.edu), Mar 25 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research