This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062045 Numbers for which the product of the digits is 12 times their sum. 1
 666, 1479, 1497, 1568, 1586, 1658, 1685, 1749, 1794, 1856, 1865, 1947, 1974, 2349, 2394, 2439, 2446, 2464, 2493, 2644, 2934, 2943, 3249, 3294, 3345, 3354, 3429, 3435, 3453, 3492, 3534, 3543, 3924, 3942, 4179, 4197, 4239, 4246, 4264, 4293, 4329, 4335, 4353, 4392, 4426, 4462, 4533, 4624, 4642, 4719, 4791, 4917, 4923, 4932, 4971, 5168, 5186, 5334, 5343, 5433, 5618, 5681, 5816, 5861, 6158, 6185, 6244, 6424, 6442, 6518, 6581, 6815, 6851, 7149, 7194, 7419, 7491, 7914 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Harry J. Smith, Table of n, a(n) for n=0,...,500 EXAMPLE 2349 belongs to the sequence as (2*3*4*9)/(2+3+4+9) = 216/18 = 12. MATHEMATICA okQ[n_]:=Module[{idn=IntegerDigits[n]}, Times@@idn/Total[idn]==12] Select[Range[10000], okQ] (* Harvey P. Dale, Nov 25 2010 *) PROG (PARI) SumD(x)= { s=0; while (x>9, s=s+x-10*(x\10); x\=10); return(s + x) } ProdD(x)= { p=1; while (x>9, p=p*(x-10*(x\10)); x\=10); return(p*x) } { n=-1; for (m=1, 10^7, if (ProdD(m)==12*SumD(m), write("b062045.txt", n++, " ", m); if (n==500, break)) ) } \\ Harry J. Smith, Jul 30 2009 CROSSREFS Sequence in context: A093733 A133562 A202445 * A043515 A051003 A183655 Adjacent sequences:  A062042 A062043 A062044 * A062046 A062047 A062048 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, Jun 28 2001 EXTENSIONS Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001 More terms from Harvey P. Dale, Nov 25 2010 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 October 14 05:08 EDT 2019. Contains 327995 sequences. (Running on oeis4.)