A379767 Triangle read by rows: row n lists numbers which are the n-th powers of their digit sum.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 81, 0, 1, 512, 4913, 5832, 17576, 19683, 0, 1, 2401, 234256, 390625, 614656, 1679616, 0, 1, 17210368, 52521875, 60466176, 205962976, 0, 1, 34012224, 8303765625, 24794911296, 68719476736, 0, 1, 612220032, 10460353203, 27512614111, 52523350144, 271818611107, 1174711139837, 2207984167552, 6722988818432
Offset: 1
Examples
Triangle begins: 1 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9; 2 | 0, 1, 81; 3 | 0, 1, 512, 4913, 5832, 17576, 19683; 4 | 0, 1, 2401, 234256, 390625, 614656, 1679616; 5 | 0, 1, 17210368, 52521875, 60466176, 205962976; 6 | 0, 1, 34012224, 8303765625, 24794911296, 68719476736; 7 | 0, 1, 612220032, 10460353203, 27512614111, 52523350144, 271818611107, 1174711139837, 2207984167552, 6722988818432; 8 | 0, 1, 20047612231936, 72301961339136, 248155780267521; 9 | 0, 1, 3904305912313344, 45848500718449031, 150094635296999121; ...
Links
- René-Louis Clerc, Rows n=1...270 of triangle, flattened
- René-Louis Clerc, Nombres de Niven-Harshad égaux à une puissance de la somme de leurs chiffres, 2024.
Crossrefs
Programs
-
PARI
R(n) = for(j=2,oo, if((j*9)^n <10^j, return(j))); row(n) = my(L=List()); for (k=0, sqrtnint(10^R(n),n), if (k^n == sumdigits(k^n)^n, listput(L, k^n))); Vec(L)
Comments