The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069147 Numbers n such that tau_3(n) (the number of ordered factorizations of n as n=rst) divides n. 0
 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 FORMULA n such that A007425(n) divides n PROG (PARI) for(n=1, 15000, if(n%sumdiv(n, d, numdiv(d))==0, print1(n, ", "))) CROSSREFS Sequence in context: A125284 A097989 A039700 * A094159 A138976 A275038 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 18 19:19 EST 2020. Contains 331029 sequences. (Running on oeis4.)