id:A096665 - OEIS Search Results

Search: id:A096665

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest number m, not occurring earlier, such that at least one prime factor of m divides at least one of the omega(m) last terms (where omega=A001221); a(1)=1, a(2)=2.

+0
4

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

	OFFSET	`1,2`
	COMMENT	`Max{GCD(a(n),a(n-i)): 1<=i<=A001222(a(n))} > 1, for n>2;` `integer permutation with inverse A096666: a(A096666(n))=A096666(a(n))=n;` `a(n) is prime iff a(n-1) = 2*a(n);` `A096667 = a(a(n)).`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Sequence in context: A073900 A026200 A026218 this_sequence A064413 A122280 A057063` `Adjacent sequences: A096662 A096663 A096664 this_sequence A096666 A096667 A096668`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 03 2004`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research