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 A256360 #27 Feb 16 2025 08:33:25 %S A256360 5,8,10,13,18,20,25,26,32,35,37,40,41,43,52,53,55,58,61,62,65,68,72, %T A256360 80,82,83,90,92,97,98,99,101,104,109,113,117,118,122,127,128,134,146, %U A256360 148,152,162,170,173,178,180,181,185,190,197,205,221,225 %N A256360 Numbers that are multiple-digit narcissistic numbers in exactly one base. %C A256360 See A258273 for the corresponding bases. %H A256360 Tim Johannes Ohrtmann, <a href="/A256360/b256360.txt">Table of n, a(n) for n = 1..49479</a> %H A256360 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 A256360 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NarcissisticNumber.html">Narcissistic Number</a> %H A256360 Wikipedia, <a href="http://en.wikipedia.org/wiki/Narcissistic_number">Narcissistic number</a> %e A256360 a(1) = 5 because this is the first number that is a multiple-digit narcissistic number in exactly one base (3). %o A256360 (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==1, print1(n, ", "))) %Y A256360 Cf. A005188. %Y A256360 Cf. A256359 (every number of bases). %Y A256360 Cf. A256361, A256362, A256363, A256364, A256365 (2 to 6 bases). %Y A256360 Cf. A256459 (first occurrences). %K A256360 nonn,base %O A256360 1,1 %A A256360 _Tim Johannes Ohrtmann_, Mar 26 2015