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!)
 A165501 Minimal common difference of maximal arithmetic progression starting at n such that each term k has tau(k)=tau(n) 2

%I

%S 1,2,5,6,2,150,19,16,12,1536160080,8,9918821194590,300,188,65,

%T 341976204789992332560,157,2166703103992332274919550,24,450,3072320160

%N Minimal common difference of maximal arithmetic progression starting at n such that each term k has tau(k)=tau(n)

%C a(1) is not well defined, since the maximal progression has only one term.

%e 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.

%Y Cf. A165499, A165500, A088430.

%K hard,nonn,more

%O 2,2

%A _Hugo van der Sanden_, Sep 21 2009, Oct 09 2009

%E Extended to n=22 taking advantage of A088430 for n=19, _Hugo van der Sanden_, Jun 02 2015

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 9 03:54 EST 2022. Contains 358698 sequences. (Running on oeis4.)