The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A173149 Numbers n such that max(tau(n),tau(n+1),tau(n+2))- min(tau(n),tau(n+1),tau(n+2)) = 1. 1

%I #10 Aug 14 2019 08:29:21

%S 1,2,3,8,14,25,121,841,1442,6241,8281,16641,20164,24962,26894,28561,

%T 46225,55225,58564,65534,67081,73441,93025,104329,110888,116281,

%U 143641,149768,155236,212521,235225,252003,271441,279841,284089,293762,293763

%N Numbers n such that max(tau(n),tau(n+1),tau(n+2))- min(tau(n),tau(n+1),tau(n+2)) = 1.

%H Amiram Eldar, <a href="/A173149/b173149.txt">Table of n, a(n) for n = 1..1000</a>

%e For n = 1, max(tau(1),tau(2),tau(3)) - min(tau(1),tau(2),tau(3)) = max(1,2,2) - min(1,2,2) = 1.

%e For n = 121, max(tau(121),tau(122),tau(123)) - min(tau(121),tau(122),tau(123)) = max(1,2,2) - min(1,2,2) = 1

%p with(numtheory):for n from 1 to 1500000 do;if max(tau(n),tau(n+1),tau(n+2))- min(tau(n),tau(n+1),tau(n+2))= 1 then print(n); else fi ; od;

%t Select[Range[10^6], Max[(d = DivisorSigma[0,#+{0,1,2}])] - Min[d] == 1 &] (* _Amiram Eldar_, Aug 14 2019 *)

%K nonn

%O 1,2

%A _Michel Lagneau_, Feb 11 2010, Feb 13 2010

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 9 02:41 EDT 2024. Contains 373227 sequences. (Running on oeis4.)