login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096665 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. 3
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; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

Table of n, a(n) for n=1..72.

Index entries for sequences that are permutations of the natural numbers

CROSSREFS

Cf. A064413. - N. J. A. Sloane, Sep 19 2012

Sequence in context: A181548 A207779 A338338 * A064413 A255348 A336946

Adjacent sequences:  A096662 A096663 A096664 * A096666 A096667 A096668

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jul 03 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 08:59 EST 2021. Contains 340416 sequences. (Running on oeis4.)