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 A049363 #55 Feb 16 2025 08:32:40
%S A049363 1,2,11,75,694,8345,123717,2177399,44317196,1023456789,26432593615,
%T A049363 754777787027,23609224079778,802772380556705,29480883458974409,
%U A049363 1162849439785405935,49030176097150555672,2200618769387072998445,104753196945250864004691,5271200265927977839335179
%N A049363 a(1) = 1; for n > 1, smallest digitally balanced number in base n.
%C A049363 A037968(a(n)) = n and A037968(m) < n for m < a(n). - _Reinhard Zumkeller_, Oct 27 2003
%C A049363 Also smallest pandigital number in base n. - _Franklin T. Adams-Watters_, Nov 15 2006
%H A049363 Reinhard Zumkeller, <a href="/A049363/b049363.txt">Table of n, a(n) for n = 1..250</a>
%H A049363 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PandigitalNumber.html">Pandigital Number</a>
%H A049363 Wikipedia, <a href="http://en.wikipedia.org/wiki/Pandigital_number">Pandigital number</a>
%H A049363 Chai Wah Wu, <a href="https://arxiv.org/abs/2403.20304">Pandigital and penholodigital numbers</a>, arXiv:2403.20304 [math.GM], 2024. See p. 1.
%F A049363 a(n) = (102345....n-1) in base n. - Ulrich Schimke (ulrschimke(AT)aol.com)
%F A049363 For n > 1, a(n) = (n^n-n)/(n-1)^2 + n^(n-2)*(n-1) - 1 = A023811(n) + A053506(n). - _Franklin T. Adams-Watters_, Nov 15 2006
%F A049363 a(n) = n^(n-1) + Sum_{m=2..n-1} m * n^(n - 1 - m). - _Alexander R. Povolotsky_, Sep 18 2022
%e A049363 a(6) = 102345_6 = 1*6^5 + 2*6^3 + 3*6^2 + 4*6^1 + 5*6^0 = 8345.
%p A049363 a:= n-> n^(n-1)+add((n-i)*n^(i-1), i=1..n-2):
%p A049363 seq(a(n), n=1..23); # _Alois P. Heinz_, May 02 2020
%t A049363 Table[FromDigits[Join[{1,0},Range[2,n-1]],n],{n,20}] (* _Harvey P. Dale_, Oct 12 2012 *)
%o A049363 (PARI) A049363(n)=n^(n-1)+sum(i=1,n-2,n^(i-1)*(n-i)) \\ _M. F. Hasler_, Jan 10 2012
%o A049363 (PARI) A049363(n)=if(n>1,(n^n-n)/(n-1)^2+n^(n-2)*(n-1)-1,1) \\ _M. F. Hasler_, Jan 12 2012
%o A049363 (Haskell)
%o A049363 a049363 n = foldl (\v d -> n * v + d) 0 (1 : 0 : [2..n-1])
%o A049363 -- _Reinhard Zumkeller_, Apr 04 2012
%o A049363 (Python)
%o A049363 def A049363(n): return (n**n-n)//(n-1)**2+n**(n-2)*(n-1)-1 if n>1 else 1 # _Chai Wah Wu_, Mar 13 2024
%Y A049363 Column k=1 of A061845 and A378000 (for n>1).
%Y A049363 Cf. A031443, A049354, A049355, A023811.
%K A049363 nonn,base,nice
%O A049363 1,2
%A A049363 _Harvey P. Dale_
%E A049363 More terms from Ulrich Schimke (ulrschimke(AT)aol.com)