OFFSET
1,2
COMMENTS
This sequence would include the terms of A274124 (digit product equal to digit sum) if the power were allowed to be 1.
This sequence is similar to A117720 (digit product is the square of the digit sum) except that powers > 2 are also included, and that A117720 does not require nondescending digits. These results are from empirical observation.
Each number of this sequence is an element of a group of permutations of its digits.
Since both addition and multiplication are commutative, it is only necessary to select one representative member of each digit permutation group. The member with digits in nondescending order is chosen.
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10753 (first 1000 terms from Robert Israel, terms <= 10^37)
Robert Kinner, Pascal Program
EXAMPLE
The product of the digits of 999 equals the sum of the digits, 27, squared.
The product of the digits of 666666 equals the cube of the sum of the digits, 36.
MAPLE
filter:= proc(n) local L, s, p;
L:= convert(n, base, 10);
s:= convert(L, `+`); p:= convert(L, `*`);
p > s and p = s^padic:-ordp(p, s)
end proc:
R:= 1: count:= 1:
Cands:= [$1..9]:
for d from 2 to 8 do
Cands:= map(proc(t) local i; seq(10*t+i, i=(t mod 10) .. 9) end proc, Cands);
V:= select(filter, Cands);
R:= R, op(V); count:= count+nops(V);
od:
R; # Robert Israel, May 15 2026
PROG
(Pascal) // See Robert Kinner link.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert Kinner, Jan 03 2025
STATUS
approved
