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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Jul 10 2020 14:09:10
%S 1,2,13,14,25,26,33,34,37,38,43,61,62,73,74,85,86,93,94,97,98,103,115,
%T 118,121,122,133,134,141,142,145,146,157,158,163,187,188,193,194,201,
%U 202,205,206,213,214,217,218,229,230,241,242,243,244,253,254,274,277
%N Numbers n such that tau(n) <= tau(n+1) <= tau(n+2) where tau(n) = number of divisors of n.
%H Karl V. Keller, Jr., <a href="/A075032/b075032.txt">Table of n, a(n) for n = 1..10000</a>
%o (Python)
%o from sympy import divisor_count as tau
%o [n for n in range(1,303) if tau(n) <= tau(n+1) <= tau(n+2)] # _Karl V. Keller, Jr._, Jul 10 2020
%Y Cf. A000005, A075033, A075034, A075035, A005238 (subsequence).
%K nonn
%O 1,2
%A _Amarnath Murthy_, Sep 02 2002
%E Corrected and extended by _Benoit Cloitre_, Sep 07 2002