This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095163 a(n) = smallest divisor d of n that occurs earlier in the sequence fewer than d times. 5
 1, 2, 3, 2, 5, 3, 7, 4, 3, 5, 11, 4, 13, 7, 5, 4, 17, 6, 19, 4, 7, 11, 23, 6, 5, 13, 9, 7, 29, 5, 31, 8, 11, 17, 7, 6, 37, 19, 13, 8, 41, 6, 43, 11, 9, 23, 47, 6, 7, 10, 17, 13, 53, 6, 11, 7, 19, 29, 59, 10, 61, 31, 9, 8, 13, 11, 67, 17, 23, 10, 71, 8, 73, 37, 15, 19, 11, 13, 79, 8, 9, 41, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Agrees with A033677 for the first 19 and many further terms; A095787 gives those n for which A033677 and the present sequence disagree. LINKS EXAMPLE For n = 12 we have divisors 1, 2, 3, 4, 6, 12; 1 occurs earlier once, 2 occurs earlier twice, 3 occurs earlier 3 times, but 4 occurs earlier only once, hence a(12) = 4. PROG (PARI) {m=83; v=vector(m); for(n=1, m, d=divisors(n); j=1; while(v[d[j]]>=d[j], j++); print1(d[j], ", "); v[d[j]]=v[d[j]]+1)} CROSSREFS Cf. A033677, A095787, A095161, A095162, A095164, A095165. Sequence in context: A219964 A165500 A072505 * A033677 A116548 A117818 Adjacent sequences:  A095160 A095161 A095162 * A095164 A095165 A095166 KEYWORD nonn AUTHOR Amarnath Murthy, Jun 01 2004 EXTENSIONS Edited and extended by Klaus Brockhaus Jun 05 2004 and Jun 09 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.

Last modified April 24 10:24 EDT 2019. Contains 322422 sequences. (Running on oeis4.)