cp's OEIS Frontend

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

%I A173156 #15 Jan 23 2023 15:34:00
%S A173156 2,20164,155236,293761,293762,643204,1435204,1444802,5216653,6120676,
%T A173156 8421601,8421602,14047501,15194404,15984004,17606413,19114383,
%U A173156 22829284,25786083,25989602,35259843,35259844,36264484,41499364,42876301,44382241,50523662,50523663
%N A173156 Numbers n such that max(tau(n),tau(n+1),tau(n+2),tau(n+3))- min(tau(n),tau(n+1),tau(n+2),tau(n+3)) = 1.
%H A173156 Giovanni Resta, <a href="/A173156/b173156.txt">Table of n, a(n) for n = 1..1000</a>
%e A173156 For n = 20164, max(tau(20164),tau(20165),tau(20166),tau(20167)) - min(tau(20164),tau(20165),tau(20166),tau(20167)) = max(9,8,8,8) - min(9,8,8,8) = 1.
%p A173156 with(numtheory):for n from 200000 to 1500000 do;if max(tau(n),tau(n+1),tau(n+2),tau(n+3))- min(tau(n),tau(n+1),tau(n+2),tau(n+3))= 1 then print(n); else fi ; od;
%t A173156 Position[Partition[DivisorSigma[0,Range[5053*10^4]],4,1],_?(Max[#]-Min[#] == 1&)]// Flatten (* _Harvey P. Dale_, Jan 23 2023 *)
%Y A173156 Cf. A000005, A006558.
%K A173156 nonn
%O A173156 1,1
%A A173156 _Michel Lagneau_, Feb 11 2010
%E A173156 a(13)-a(28) from _Giovanni Resta_, Jun 12 2016