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.

A074771 Numbers k such that tau(k) < tau(k+1), phi(k) < phi(k+1) and sigma(k) < sigma(k+1).

This page as a plain text file.
%I A074771 #18 Sep 12 2020 03:24:58
%S A074771 62,74,134,146,254,398,404,458,482,494,554,566,614,626,662,674,692,
%T A074771 758,764,794,818,854,914,998,1034,1094,1124,1214,1238,1286,1322,1394,
%U A074771 1454,1514,1538,1646,1658,1682,1826,1844,1874,1934,2078,2114,2174,2234,2246
%N A074771 Numbers k such that tau(k) < tau(k+1), phi(k) < phi(k+1) and sigma(k) < sigma(k+1).
%C A074771 There are few odd terms in the sequence, first one is 18015.
%H A074771 Amiram Eldar, <a href="/A074771/b074771.txt">Table of n, a(n) for n = 1..10000</a>
%H A074771 Vaclav Kotesovec, <a href="/A074771/a074771.jpg">Plot of a(n)/n for n = 1..360000</a>
%F A074771 It seems that a(n) is asymptotic to c*n with 51<=c<=52
%t A074771 Select[Range[1, 3000], DivisorSigma[0,#] < DivisorSigma[0,#+1] && EulerPhi[#] < EulerPhi[#+1] && DivisorSigma[1,#] < DivisorSigma[1,#+1]&] (* _Vaclav Kotesovec_, Feb 16 2019 *)
%t A074771 Position[Partition[Table[{DivisorSigma[0,n],EulerPhi[n],DivisorSigma[1,n]},{n,2300}],2,1],_?(Max[#[[1]]-#[[2]]]<0&),1,Heads-> False]// Flatten (* _Harvey P. Dale_, Jun 23 2019 *)
%Y A074771 Subsequence of A074772 and A074775.
%Y A074771 Cf. A000005, A000010, A000203.
%K A074771 nonn
%O A074771 1,1
%A A074771 _Benoit Cloitre_, Sep 07 2002