(MAGMAMagma) [n: n in [1..1000] | IsIntegral((EulerPhi(n))/&+Intseq(n))]; // Marius A. Burtea, Dec 20 2018
(MAGMAMagma) [n: n in [1..1000] | IsIntegral((EulerPhi(n))/&+Intseq(n))]; // Marius A. Burtea, Dec 20 2018
Marius A. Burtea and Muniru A Asiru, <a href="/A216836/b216836_1.txt">Table of n, a(n) for n = 1..10000</a> (first 3028 terms from Marius A. Burtea)
proposed
approved
editing
proposed
If n is in the sequence, then so is 10*n. - Robert Israel, Dec 20 2018
select(n -> numtheory:-phi(n) mod convert(convert(n, base, 10), `+`) = 0, [$1..1000]); # Robert Israel, Dec 20 2018
proposed
editing
editing
proposed
Marius A. Burtea, and Muniru A Asiru, <a href="/A216836/b216836_1.txt">Table of n, a(n) for n = 1..10000</a> (first 3028</a> terms from Marius A. Burtea)
proposed
editing
editing
proposed
(GAP) nmax:=150;;
S:=List(List([1..nmax], n->ListOfDigits(n)), Sum);; P:=List([1..nmax], n->Phi(n));;
a:=Filtered([1..nmax], i->P[i] mod S[i]=0); # Muniru A Asiru, Dec 20 2018
proposed
editing
editing
proposed