cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-9 of 9 results.

A062035 Positive numbers whose product of digits is three times their sum.

Original entry on oeis.org

66, 159, 167, 176, 195, 235, 253, 325, 333, 352, 519, 523, 532, 591, 617, 671, 716, 761, 915, 951, 1168, 1186, 1236, 1263, 1326, 1362, 1618, 1623, 1632, 1681, 1816, 1861, 2136, 2163, 2316, 2361, 2613, 2631, 3126, 3162, 3216, 3261, 3612, 3621, 6118
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			235 belongs to the sequence as (2*3*5)/(2+3+5) = 30/10 = 3.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062036, A062382, A062037, A062384, A062040, A062041, A062043, A062045.

Programs

  • Mathematica
    s3Q[n_]:=Module[{idn=IntegerDigits[n]},3Total[idn]==Times@@idn]; Select[Range[7000],s3Q]  (* Harvey P. Dale, Mar 20 2011 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==3*vecsum(d) \\ Mohammed Yaseen, Jul 29 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 3*sum(d)
print([k for k in range(1, 7000) if ok(k)]) # Michael S. Branicky, Jul 29 2022

Extensions

Corrected and extended by Harvey P. Dale and Larry Reeves (larryr(AT)acm.org), Jul 04 2001
Offset corrected by Mohammed Yaseen, Jul 29 2022

A062036 Positive numbers whose product of digits is four times their sum.

Original entry on oeis.org

88, 189, 198, 246, 264, 426, 462, 624, 642, 819, 891, 918, 981, 1247, 1274, 1344, 1427, 1434, 1443, 1472, 1724, 1742, 2147, 2174, 2226, 2262, 2417, 2471, 2622, 2714, 2741, 3144, 3414, 3441, 4127, 4134, 4143, 4172, 4217, 4271, 4314, 4341, 4413, 4431
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			1344 belongs to the sequence as (1*3*4*4)/(1+3+4+4) = 48/12 = 4.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062382, A062037, A062384, A062040, A062041, A062043, A062045.

Programs

  • Mathematica
    p4sQ[n_]:=Module[{idn=IntegerDigits[n]},Times@@idn/Total[idn]==4]; Select[Range[5000],p4sQ]  (* Harvey P. Dale, Apr 26 2011 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==4*vecsum(d) \\ Mohammed Yaseen, Jul 31 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 4*sum(d)
print([k for k in range(1, 5000) if ok(k)]) # Michael S. Branicky, Jul 31 2022

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Offset corrected by Mohammed Yaseen, Jul 31 2022

A062037 Positive numbers whose product of digits is 6 times their sum.

Original entry on oeis.org

268, 286, 347, 374, 437, 473, 628, 682, 734, 743, 826, 862, 1269, 1296, 1348, 1356, 1365, 1384, 1438, 1483, 1536, 1563, 1629, 1635, 1653, 1692, 1834, 1843, 1926, 1962, 2169, 2196, 2237, 2273, 2327, 2334, 2343, 2372, 2433, 2619, 2691, 2723, 2732, 2916
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			2237 belongs to the sequence as (2*2*3*7)/(2+2+3+7) = 84/14 = 6.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062384, A062040, A062041, A062043, A062045.

Programs

  • Mathematica
    p6sQ[n_]:=Module[{idn=IntegerDigits[n]},Times@@idn==6*Total[idn]]; Select[ Range[ 3000],p6sQ] (* Harvey P. Dale, Aug 17 2014 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==6*vecsum(d) \\ Mohammed Yaseen, Aug 02 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 6*sum(d)
print([k for k in range(1, 3000) if ok(k)]) # Michael S. Branicky, Aug 02 2022

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Offset corrected by Mohammed Yaseen, Aug 02 2022

A062043 Positive numbers whose product of digits is 10 times their sum.

Original entry on oeis.org

459, 495, 549, 594, 945, 954, 1566, 1656, 1665, 2259, 2295, 2355, 2529, 2535, 2553, 2592, 2925, 2952, 3255, 3525, 3552, 5166, 5229, 5235, 5253, 5292, 5325, 5352, 5523, 5532, 5616, 5661, 5922, 6156, 6165, 6516, 6561, 6615, 6651, 9225, 9252, 9522
Offset: 1

Views

Author

Amarnath Murthy, Jun 28 2001

Keywords

Comments

A subsequence of A011535 as each term must include the digit 5. - Chai Wah Wu, Dec 09 2015

Examples

			594 belongs to the sequence as (5*9*4)/(5+9+4) = 180/18 = 10.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062384, A062040, A062041, A062045.
Cf. A011535, A124694.

Programs

  • Maple
    filter:= proc(t) local L;
  L:= convert(t,base,10);
  convert(L,`*`) = 10*convert(L,`+`)
end proc:
select(filter, [$1..10^5]); # Robert Israel, Sep 11 2022
  • Mathematica
    Select[Range[10000], Times @@ IntegerDigits[ # ] == 10 Plus @@ IntegerDigits[ # ] &] (* Tanya Khovanova, Dec 25 2006 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==10*vecsum(d) \\ Mohammed Yaseen, Sep 11 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 10*sum(d)
print([k for k in range(1, 9999) if ok(k)]) # Michael S. Branicky, Sep 11 2022

Extensions

More terms from Harvey P. Dale and Larry Reeves (larryr(AT)acm.org), Jul 06 2001

A062382 Positive numbers whose product of digits is 5 times their sum.

Original entry on oeis.org

257, 275, 345, 354, 435, 453, 527, 534, 543, 572, 725, 752, 1258, 1285, 1528, 1582, 1825, 1852, 2158, 2185, 2235, 2253, 2325, 2352, 2518, 2523, 2532, 2581, 2815, 2851, 3225, 3252, 3522, 5128, 5182, 5218, 5223, 5232, 5281, 5322, 5812, 5821, 8125, 8152
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			2235 belongs to the sequence as (2*2*3*5)/(2+2+3+5) = 60/12 = 5.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062036, A062037, A062384, A062040, A062041, A062043, A062045.

Programs

  • Mathematica
    Select[Range[9000],Times@@IntegerDigits[#]==5*Total[IntegerDigits[#]]&] (* Harvey P. Dale, Mar 01 2012 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==5*vecsum(d) \\ Mohammed Yaseen, Aug 02 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 5*sum(d)
print([k for k in range(1, 9000) if ok(k)]) # Michael S. Branicky, Aug 02 2022

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Offset corrected by Mohammed Yaseen, Aug 02 2022

A062034 Positive numbers whose product of digits is twice the sum of the digits.

Original entry on oeis.org

36, 44, 63, 138, 145, 154, 183, 224, 242, 318, 381, 415, 422, 451, 514, 541, 813, 831, 1146, 1164, 1225, 1233, 1252, 1323, 1332, 1416, 1461, 1522, 1614, 1641, 2125, 2133, 2152, 2215, 2222, 2251, 2313, 2331, 2512, 2521, 3123, 3132, 3213, 3231, 3312, 3321
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			1225 belongs to the sequence as (1*2*2*5)/(1+2+2+5) =20/10 = 2.

Links

Crossrefs

Cf. A011540, A034710, A062035, A062036, A062382, A062037, A062384, A062040, A062041, A062043, A062045.

Programs

  • Mathematica
    Select[Range[4000],Times@@IntegerDigits[#]==2Total[IntegerDigits[#]]&] (* Harvey P. Dale, Dec 11 2016 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==2*vecsum(d) \\ Mohammed Yaseen, Jul 28 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 2*sum(d)
print([k for k in range(1, 4000) if ok(k)]) # Michael S. Branicky, Jul 28 2022

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Offset corrected by Mohammed Yaseen, Jul 28 2022

A062040 Positive numbers whose product of digits is 8 times their sum.

Original entry on oeis.org

448, 456, 465, 484, 546, 564, 645, 654, 844, 1368, 1386, 1449, 1494, 1638, 1683, 1836, 1863, 1944, 2248, 2256, 2265, 2284, 2428, 2482, 2526, 2562, 2625, 2652, 2824, 2842, 3168, 3186, 3618, 3681, 3816, 3861, 4149, 4194, 4228, 4282, 4419, 4491, 4822
Offset: 1

Views

Author

Amarnath Murthy, Jun 28 2001

Keywords

Examples

			2248 belongs to the sequence as (2*2*4*8)/(2+2+4+8) = 128/16 = 8.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062384, A062041, A062043, A062045.

Programs

  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==8*vecsum(d) \\ Mohammed Yaseen, Sep 11 2022

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Offset corrected by Mohammed Yaseen, Sep 11 2022

A062045 Positive numbers whose product of digits is 12 times their sum.

Original entry on oeis.org

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
Offset: 1

Views

Author

Amarnath Murthy, Jun 28 2001

Keywords

Examples

			2349 belongs to the sequence as (2*3*4*9)/(2+3+4+9) = 216/18 = 12.

Links

Crossrefs

Subsequence of A061013 and hence A038367 and A052382.
Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062384, A062040, A062041, A062043.

Programs

  • Mathematica
    okQ[n_]:=Module[{idn=IntegerDigits[n]},Times@@idn/Total[idn]==12]
Select[Range[10000],okQ] (* Harvey P. Dale, Nov 25 2010 *)
  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==12*vecsum(d) \\ Mohammed Yaseen, Sep 12 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return prod(d) == 12*sum(d)
print([k for k in range(1, 4400) if ok(k)]) # Michael S. Branicky, Sep 12 2022

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
More terms from Harvey P. Dale, Nov 25 2010
Offset corrected by Mohammed Yaseen, Sep 12 2022

A062384 Positive numbers whose product of digits is 7 times their sum.

Original entry on oeis.org

279, 297, 357, 375, 537, 573, 729, 735, 753, 792, 927, 972, 1447, 1474, 1744, 4147, 4174, 4417, 4471, 4714, 4741, 7144, 7414, 7441, 11367, 11376, 11637, 11673, 11736, 11763, 12247, 12274, 12427, 12472, 12724, 12742, 13167, 13176, 13617, 13671
Offset: 1

Views

Author

Amarnath Murthy, Jun 27 2001

Keywords

Examples

			1447 belongs to the sequence as (1*4*4*7)/(1+4+4+7) = 112/16 = 7.

Links

Crossrefs

Cf. A011540, A034710, A062034, A062035, A062036, A062382, A062037, A062040, A062041, A062043, A062045.

Programs

  • PARI
    isok(n) = my(d=digits(n)); vecprod(d)==7*vecsum(d) \\ Mohammed Yaseen, Sep 09 2022
  • Python
    from math import prod
def ok(n): d = list(map(int, str(n))); return n > 0 and prod(d) == 7*sum(d)
print([k for k in range(14000) if ok(k)]) # Michael S. Branicky, Sep 09 2022

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
Showing 1-9 of 9 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.