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.

A364720 Numbers k such that d(k) > d(k+1) > d(k+2) > d(k+3) > d(k+4), where d(n) is the number of divisors of n.

This page as a plain text file.
%I A364720 #18 Mar 30 2024 13:33:30
%S A364720 28974,28975,39150,39444,39445,44863,60775,64015,68875,71995,75174,
%T A364720 79135,79848,79849,91195,103615,113904,113905,118825,126294,141955,
%U A364720 143143,148974,149823,150955,154375,160734,160735,160974,161343,167824,171925,177330,181194,181195
%N A364720 Numbers k such that d(k) > d(k+1) > d(k+2) > d(k+3) > d(k+4), where d(n) is the number of divisors of n.
%H A364720 Seiichi Manyama, <a href="/A364720/b364720.txt">Table of n, a(n) for n = 1..1000</a>
%t A364720 Flatten@Position[Differences@# &/@Partition[DivisorSigma[0, Range@1000000],5,1], {_?(# < 0 &) ..}] (* _Hans Rudolf Widmer_, Mar 11 2024 *)
%o A364720 (PARI) isok(n) = numdiv(n)>numdiv(n+1) && numdiv(n+1)>numdiv(n+2) && numdiv(n+2)>numdiv(n+3) && numdiv(n+3)>numdiv(n+4);
%Y A364720 Cf. A000005, A075029.
%Y A364720 Cf. A074827, A364718, A364719.
%K A364720 nonn,easy
%O A364720 1,1
%A A364720 _Seiichi Manyama_, Aug 04 2023