cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A075032 Numbers n such that tau(n) <= tau(n+1) <= tau(n+2) where tau(n) = number of divisors of n.

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