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.

A068547 Numbers m such that m*tau(m)>5*prime(m).

This page as a plain text file.
%I A068547 #15 May 15 2025 18:11:22
%S A068547 2520,3360,3780,3960,4200,4320,5040,6300,6720,7200,7560,7920,8400,
%T A068547 8640,8820,9240,9360,9900,10080,10560,10800,10920,11088,11340,11520,
%U A068547 11700,11760,11880,12096,12240,12480,12600,12960,13104,13200,13440,13680
%N A068547 Numbers m such that m*tau(m)>5*prime(m).
%H A068547 Robert Israel, <a href="/A068547/b068547.txt">Table of n, a(n) for n = 1..10000</a>
%p A068547 R:= NULL: count:= 0: p:= 0:
%p A068547 for n from 1 while count < 100 do
%p A068547   p:= nextprime(p);
%p A068547   if n * numtheory:-tau(n) > 5 * p then R:= R,n; count:= count+1;  fi;
%p A068547 od:
%p A068547 R; # _Robert Israel_, May 13 2025
%t A068547 Select[Range[15000],# DivisorSigma[0,#]>5 Prime[#]&] (* _Harvey P. Dale_, Jul 17 2023 *)
%Y A068547 Cf. A001750, A038040.
%Y A068547 Cf. A068544, A068545, A068546.
%K A068547 easy,nonn
%O A068547 1,1
%A A068547 _Benoit Cloitre_, Mar 22 2002