|
Search: id:A069147
|
|
|
| A069147 |
|
Numbers n such that tau_3(n) (the number of ordered factorizations of n as n=rst) divides n. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
n such that A007425(n) divides n
|
|
PROGRAM
|
(PARI) for(n=1, 15000, if(n%sumdiv(n, d, numdiv(d))==0, print1(n, ", ")))
|
|
CROSSREFS
|
Adjacent sequences: A069144 A069145 A069146 this_sequence A069148 A069149 A069150
Sequence in context: A125284 A097989 A039700 this_sequence A094159 A138976 A064043
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 08 2002
|
|
|
Search completed in 0.002 seconds
|
