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!)
A075035 Numbers n such that tau(n) >= tau(n+1) >= tau(n+2) >= tau(n+3) where tau(n) = number of divisors of n. 4

%I #25 Jul 10 2020 12:53:11

%S 20,32,44,56,80,84,92,104,116,140,170,176,200,212,216,224,230,242,260,

%T 296,300,324,332,344,374,380,392,434,440,444,464,476,500,506,512,560,

%U 594,602,608,620,632,644,650,696,704,714,715,716,740,776,800,804,836

%N Numbers n such that tau(n) >= tau(n+1) >= tau(n+2) >= tau(n+3) where tau(n) = number of divisors of n.

%H Harvey P. Dale, <a href="/A075035/b075035.txt">Table of n, a(n) for n = 1..10000</a>

%t Position[Partition[DivisorSigma[0,Range[900]],4,1],_?(Max[ Differences[ #]]< 1&),1,Heads->False]//Flatten (* _Harvey P. Dale_, Sep 05 2019 *)

%o (Python)

%o from sympy import divisor_count as tau

%o [n for n in range(1,901) if tau(n) >= tau(n+1) >= tau(n+2) >= tau(n+3)] # _Karl V. Keller, Jr._, Jul 10 2020

%Y Cf. A075032, A075033, A075034.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Sep 02 2002

%E More terms from _Benoit Cloitre_, Sep 07 2002

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 March 28 04:55 EDT 2024. Contains 371235 sequences. (Running on oeis4.)