login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086571 a(1)=1, for n>1: a(n) = smallest divisor of n occurring earlier at most once. 9
1, 1, 3, 2, 5, 2, 7, 4, 3, 5, 11, 4, 13, 7, 15, 8, 17, 6, 19, 10, 21, 11, 23, 6, 25, 13, 9, 14, 29, 10, 31, 8, 33, 17, 35, 9, 37, 19, 39, 20, 41, 14, 43, 22, 15, 23, 47, 12, 49, 25, 51, 26, 53, 18, 55, 28, 57, 29, 59, 12, 61, 31, 21, 16, 65, 22, 67, 34, 69, 35, 71, 18, 73 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

a(A086939(n)) = a(A086938(n)) = n. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 24 2003

EXAMPLE

a(p) = p for primes p>2;

divisor set of n=12: {1,2,3,4,6,12}, divisors occurring <12: 1=a(1)=a(2), 2=a(4)=a(6), 3=a(3)=a(9) and 4=a(8); as 4 occurs only once a(12)=4.

CROSSREFS

Cf. A086572.

Sequence in context: A069735 A046524 A105222 * A133945 A124219 A103833

Adjacent sequences:  A086568 A086569 A086570 * A086572 A086573 A086574

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 22 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 22:36 EST 2012. Contains 205567 sequences.