The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069147 Numbers k such that tau_3(k) (the number of ordered factorizations of k as k = r*s*t) divides k. 1
 1, 3, 18, 36, 270, 360, 405, 540, 810, 1000, 1620, 1701, 1800, 1890, 2835, 2970, 3000, 3402, 3510, 3780, 4032, 4050, 4455, 4590, 5130, 5265, 5400, 5670, 5940, 6210, 6804, 6885, 7020, 7695, 7830, 8100, 8370, 8505, 8910, 9000, 9180, 9315, 9990, 10260 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 FORMULA k such that A007425(k) divides k. MATHEMATICA f[p_, e_] := (e + 1)*(e + 2)/2; tau3[1] = 1; tau3[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[10^4], Divisible[#, tau3[#]] &] (* Amiram Eldar, May 17 2020 *) PROG (PARI) for(n=1, 15000, if(n%sumdiv(n, d, numdiv(d))==0, print1(n, ", "))) CROSSREFS Cf. A007425, A033950. Sequence in context: A125284 A097989 A039700 * A337921 A094159 A138976 Adjacent sequences:  A069144 A069145 A069146 * A069148 A069149 A069150 KEYWORD easy,nonn AUTHOR Benoit Cloitre, Apr 08 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 17:47 EST 2022. Contains 350402 sequences. (Running on oeis4.)