id:A089088 - OEIS Search Results

Search: id:A089088

Displaying 1-1 of 1 results found.

page 1

a(0) = 1, a(1) = 2; for n>1, a(n) = smallest positive number not already in sequence which has GCD > 1 with some earlier term.

+0
4

1, 2, 4, 6, 3, 8, 9, 10, 5, 12, 14, 7, 15, 16, 18, 20, 21, 22, 11, 24, 25, 26, 13, 27, 28, 30, 32, 33, 34, 17, 35, 36, 38, 19, 39, 40, 42, 44, 45, 46, 23, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 29, 60, 62, 31, 63, 64, 65, 66, 68, 69, 70, 72, 74, 37, 75, 76, 77, 78, 80, 81, 82, 41, 84, 85, 86, 43, 87, 88, 90, 91, 92, 93, 94, 47, 95, 96, 98, 99 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`This is a permutation of the natural numbers.` `For n>2: a(n) is prime iff a(n) < a(n-1); a(A112988 (n))=A000040(n); inverse: A112990. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 08 2005`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Cf. A064413.` `Cf. A112975.` `Adjacent sequences: A089085 A089086 A089087 this_sequence A089089 A089090 A089091` `Sequence in context: A117532 A057336 A115316 this_sequence A073899 A101543 A073900`
	KEYWORD	`nonn,nice,easy`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Dec 04 2003`
	EXTENSIONS	`More terms from Victoria A Sapko (vsapko(AT)canes.gsw.edu), Jun 16 2004`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research