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.

A068545 Numbers n such that n*tau(n)>3*prime(n).

This page as a plain text file.
%I A068545 #10 May 13 2025 20:58:48
%S A068545 180,240,360,420,480,504,540,600,630,660,672,720,756,780,792,840,864,
%T A068545 900,924,936,960,990,1008,1020,1050,1056,1080,1200,1260,1296,1320,
%U A068545 1344,1440,1512,1560,1584,1620,1680,1728,1764,1800,1848,1872,1890,1920,1980
%N A068545 Numbers n such that n*tau(n)>3*prime(n).
%H A068545 Robert Israel, <a href="/A068545/b068545.txt">Table of n, a(n) for n = 1..10000</a>
%p A068545 R:= NULL: count:= 0: p:= 0:
%p A068545 for n from 1 while count < 100 do
%p A068545   p:= nextprime(p);
%p A068545   if n * numtheory:-tau(n) > 3 * p then R:= R,n; count:= count+1; fi;
%p A068545 od:
%p A068545 R; # _Robert Israel_, May 13 2025
%K A068545 easy,nonn
%O A068545 1,1
%A A068545 _Benoit Cloitre_, Mar 22 2002