This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165501 Minimal common difference of maximal arithmetic progression starting at n such that each term k has tau(k)=tau(n) 2
 1, 2, 5, 6, 2, 150, 19, 16, 12, 1536160080, 8, 9918821194590, 300, 188, 65, 341976204789992332560, 157, 2166703103992332274919550, 24, 450, 3072320160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS a(1) is not well defined, since the maximal progression has only one term. LINKS EXAMPLE For n=6, A165500(n)=3, and the least difference d such that tau(6) = tau(6+d) = tau(6+2d) is d=2, so a(6)=2. CROSSREFS Cf. A165499, A165500, A088430. Sequence in context: A143678 A021800 A140862 * A274614 A062825 A154925 Adjacent sequences:  A165498 A165499 A165500 * A165502 A165503 A165504 KEYWORD hard,nonn,more AUTHOR Hugo van der Sanden, Sep 21 2009, Oct 09 2009 EXTENSIONS Extended to n=22 taking advantage of A088430 for n=19, Hugo van der Sanden, Jun 02 2015 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.