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 A302649 #15 Jun 25 2018 02:57:21 %S A302649 5,8,14,3953,33626,89843301,71341793655800,245916794707565, %T A302649 19429639306542698,36106092555634673,1818632037625982420, %U A302649 4099389352522800257,51096092690519702666,1361788669288181208317,80939622935362328928524,3061856409269150191916609 %N A302649 Numbers that are the sum of some fixed power of the digits of their ten's complement. %C A302649 No other term up to 3*10^12. - _Giovanni Resta_, Apr 12 2018 %H A302649 Chai Wah Wu, <a href="/A302649/b302649.txt">Table of n, a(n) for n = 1..22</a> %e A302649 (10 - 5) = 5 and 5^1 = 5; %e A302649 (10 - 8) = 2 and 2^3 = 8; %e A302649 (100 - 14) = 86 and 8^1 + 6^1 = 14; %e A302649 (10000 - 3953) = 6047 and 6^4 + 0^4 + 4^4 + 7^4 = 3953; %e A302649 (100000 - 33626) = 66374 and 6^5 + 6^5 + 3^5 + 7^5 + 4^5 = 33626; %e A302649 (100000000 - 89843301) = 10156699 and 1^8 + 0^8 + 1^8 + 5^8 + 6^8 + 6^8 + 9^8 + 9^8 = 89843301. %p A302649 with(numtheory): P:=proc(q) local a,b,i,j,k,n; %p A302649 for n from 1 to q do a:=convert(10^(ilog10(n)+1)-n,base,10); %p A302649 b:=convert(a,`+`); j:=1; i:=0; while n>b do %p A302649 if i=b then break; else i:=b; j:=j+1; b:=add(a[k]^j,k=1..nops(a)); fi; od; %p A302649 if n=b then print(n); fi; od; end: P(10^9); %Y A302649 Cf. A023052, A261433, A302651. %K A302649 nonn,base %O A302649 1,1 %A A302649 _Paolo P. Lava_, Apr 11 2018 %E A302649 a(7)-a(16) from _Chai Wah Wu_, Jun 06 2018