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.

A188598 Numbers k such that d(k-1) > d(k) > d(k+1) where d(k) is the number of divisors of k.

This page as a plain text file.
%I A188598 #20 Jul 17 2019 07:37:34
%S A188598 46,81,82,106,166,225,226,261,262,273,316,325,346,358,385,406,436,441,
%T A188598 442,465,466,477,478,496,513,556,561,562,568,586,595,596,621,625,628,
%U A188598 651,652,676,705,715,716,796,801,826,837,838,856,861,862,885,886,892,897,916,925,946,976,981,982
%N A188598 Numbers k such that d(k-1) > d(k) > d(k+1) where d(k) is the number of divisors of k.
%C A188598 A000005(a(n)-1) > A000005(a(n)) > A000005(a(n)+1).
%H A188598 Amiram Eldar, <a href="/A188598/b188598.txt">Table of n, a(n) for n = 1..10000</a>
%t A188598 Select[Range[2, 1000], DivisorSigma[0, # - 1] > DivisorSigma[0, #] > DivisorSigma[0, # + 1] &] (* _T. D. Noe_, Apr 05 2011 *)
%Y A188598 Cf. A000005, A188631, A075029.
%K A188598 nonn
%O A188598 1,1
%A A188598 _Juri-Stepan Gerasimov_, Apr 05 2011
%E A188598 Corrected and extended by _T. D. Noe_, Apr 05 2011