OFFSET
1,2
COMMENTS
Sequence is infinite because it contains all the numbers made of k fours and 8^k-4k ones. - Giovanni Resta, Sep 01 2015
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
Charles R Greathouse IV, GP script
EXAMPLE
11114 appears in the sequence because (1 + 1 + 1 + 1 + 4)^2 = (1*1*1*1*4)^3 = 64.
111122 appears in the sequence because (1 + 1 + 1 + 1 + 2 + 2)^2 = (1*1*1*1*2*2)^3 = 64.
MATHEMATICA
Select[Range[20000000], Plus @@ IntegerDigits[#]^2 == Times @@ IntegerDigits[#]^3 &]
PROG
(PARI) for(n = 1, 1000000, d = digits(n); if((sumdigits(n))^2 == prod(i = 1, #d, d[i])^3, print1(n, ", ")));
(PARI) proddigits(n)=my(d=digits(n)); prod(i=1, #d, d[i])
is(n)=my(s=sumdigits(n)); if(!ispower(s, 3), return(0)); s^2==proddigits(n)^3 \\ Charles R Greathouse IV, Aug 31 2015
(Magma) [n : n in [1..1000000] | (&+Intseq(n))^2 eq (&*Intseq(n))^3 ];
CROSSREFS
KEYWORD
nonn,base
AUTHOR
K. D. Bajpai, Aug 31 2015
EXTENSIONS
a(22)-a(27) from Charles R Greathouse IV, Aug 31 2015
STATUS
approved