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 A256362 #26 Feb 16 2025 08:33:25 %S A256362 125,325,370,793,845,1125,1445,2080,2125,2925,3125,3200,3725,3757, %T A256362 5050,5265,6125,6250,6845,7605,8125,8405,10125,10261,10440,10625, %U A256362 11250,13005,13690,14365,15125,15925,18785,22100 %N A256362 Numbers that are multiple-digit narcissistic numbers in exactly three bases. %H A256362 Tim Johannes Ohrtmann, <a href="/A256362/b256362.txt">Table of n, a(n) for n = 1..445</a> %H A256362 W. Schneider, <a href="http://web.archive.org/web/20050213060737/http://www.wschnei.de/digit-related-numbers/pdi.html">Perfect Digital Invariants: Pluperfect Digital Invariants(PPDIs)</a> %H A256362 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NarcissisticNumber.html">Narcissistic Number</a> %H A256362 Wikipedia, <a href="http://en.wikipedia.org/wiki/Narcissistic_number">Narcissistic number</a> %e A256362 a(1) = 125 because this is the first number that is a multiple-digit narcissistic number in exactly three bases (12, 23 and 57). %o A256362 (PARI) for(n=3, 1000000, k=0; for(z=2, n, y=n; j=0; L=List(); until(y==0, x=y%z; j++; listinsert(L, x, j); while(!((y%z)==0), y--); y=y/z); t=0; for(p=1, j, t+=L[p]^j); if(n==t, k++)); if(k==3, print1(n, ", "))) %Y A256362 Cf. A005188. %Y A256362 Cf. A256359 (every number of bases). %Y A256362 Cf. A256360, A256361, A256363, A256364, A256365 (1, 2, 4, 5 and 6 bases). %Y A256362 Cf. A256459 (first occurrences). %K A256362 nonn,base %O A256362 1,1 %A A256362 _Tim Johannes Ohrtmann_, Mar 26 2015