The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135545 a(n) = the largest proper divisor k of n where (k-1) and/or (k+1) divides (n+1). 1
 1, 2, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 4, 3, 2, 1, 6, 1, 2, 3, 2, 1, 2, 1, 4, 3, 2, 7, 2, 1, 2, 3, 2, 1, 2, 1, 4, 3, 2, 1, 8, 1, 2, 3, 2, 1, 6, 5, 4, 3, 2, 1, 2, 1, 2, 9, 4, 5, 2, 1, 4, 3, 2, 1, 2, 1, 2, 5, 2, 7, 2, 1, 10, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 4, 3, 2, 5, 2, 1, 2, 11, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,2 LINKS G. C. Greubel, Table of n, a(n) for n = 3..1000 EXAMPLE The proper divisors of 14 are 1,2,7. Now 2 is the largest of these divisors k where (k-1) and/or (k+1) divides 15 -- both (2-1) and (2+1) divide 15. So a(14) = 2. MATHEMATICA Table[Max[Join[{1}, Select[Complement[Divisors[n], {1, n}], Mod[n + 1, # + 1] == 0 || Mod[n + 1, # - 1] == 0 &]]], {n, 3, 100}] (* Stefan Steinerberger, Aug 30 2008 *) CROSSREFS Sequence in context: A030767 A352933 A276976 * A123317 A231557 A171453 Adjacent sequences: A135542 A135543 A135544 * A135546 A135547 A135548 KEYWORD nonn AUTHOR Leroy Quet, May 10 2008 EXTENSIONS More terms from Stefan Steinerberger, Aug 30 2008 STATUS approved

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

Last modified December 8 05:37 EST 2022. Contains 358672 sequences. (Running on oeis4.)