|
Search: id:A064154
|
|
|
| A064154 |
|
Let n=x1x2x3...xk be an integer in base 10 with k digits. The sequence give the integers n such that x1*x2*x3*...xk=k*(x1+x2+x3..+xk). |
|
+0
1
|
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 36, 44, 63, 159, 167, 176, 195, 235, 253, 325, 333, 352, 519, 523, 532, 591, 617, 671, 716, 761, 915, 951, 1247, 1274, 1344, 1427, 1434, 1443, 1472, 1724, 1742, 2147, 2174, 2226, 2262, 2417, 2471, 2622, 2714, 2741, 3144, 3414
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
EXAMPLE
|
36 belongs to the sequence because 3*6=18 and 2*(3+6)=18
|
|
PROGRAM
|
(PARI) ProdD(x)= { local(p); p=1; while (x>9 && p>0, p*=(x-10*(x\10)); x\=10); return(p*x) } SumD(x)= { local(s); s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } digitsIn(x)= { local(d); if (x==0, return(1)); d=1 + log(x)\log(10); if (10^d == x, d++, if (10^(d-1) > x, d--)); return(d) } { n=-1; for (m=0, 10^9, if (((p=ProdD(m)) || m==0) && p == digitsIn(m)*SumD(m), write("b064154.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 09 2009]
|
|
CROSSREFS
|
Sequence in context: A024658 A004849 A072482 this_sequence A080161 A098771 A024659
Adjacent sequences: A064151 A064152 A064153 this_sequence A064155 A064156 A064157
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Sep 14 2001
|
|
|
Search completed in 0.002 seconds
|
