Numbers n such that n = Sum_{i=1..j} (phi(n) mod d(i)), where phi(n) is the Euler totient function of n and d(i) are the divisors of n.
A273292
Numbers n such that n = Sum_{i=1..j} (phi(n) mod d(i)), where phi(n) is the Euler totient function of n and d(i) are the divisors of n.
Terms
- a(0) =80a(1) =400a(2) =693a(3) =2000a(4) =3290a(5) =7030a(6) =10000a(7) =24150a(8) =50000a(9) =191961a(10) =250000a(11) =610718a(12) =1214425a(13) =1250000a(14) =2194778a(15) =6250000a(16) =31250000a(17) =75369362a(18) =156250000a(19) =234392726a(20) =572760397a(21) =588270806a(22) =590434574a(23) =595208594a(24) =781250000a(25) =1547001099a(26) =2889682738a(27) =3906250000a(28) =7627258546a(29) =10614420142
External references
- oeis: A273292