This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A226970 #17 Mar 30 2017 22:35:17 %S A226970 0,1,146511208,472335975,534494836,912985153 %N A226970 Fixed points for the operation of repeatedly replacing a number with the sum of the ninth powers of its digits. %C A226970 The only six integers equal to the sum of the ninth powers of their digits. %C A226970 This is row n=9 of A252648. For a d-digit number n >= 10^(d-1), the sum of 9th powers of its digits is <= 9^9*d, therefore n <= 4112105981. - _M. F. Hasler_, Apr 12 2015 %e A226970 a(3) = A003321(9); %e A226970 a(4) = 472335975 = 4^9 + 7^9 + 2^9 + 3^9 + 3^9 + 5^9 + 9^9 + 7^9 + 5^9. %o A226970 (PARI) is_A226970(n)=n==sum(i=1,#n=digits(n),n[i]^9) %o A226970 for(n=0,4112105981,is_A226970(n)&&print1(n",")) \\ _M. F. Hasler_, Apr 12 2015 %Y A226970 Cf. A046197, A052455, A052464, A124068, A124069, A003321. %K A226970 nonn,base,fini,full %O A226970 1,3 %A A226970 _Michel Lagneau_, Jun 24 2013