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 A248616 #20 Aug 06 2025 22:40:07
%S A248616 1,2,5,6,11,9,9,13,16,19,16,27,19,29,33,35,36,41,36,38,41,34,40,55,56,
%T A248616 62,73,65,67,62,70,77,77,74,76,95,92,103,97,91,89,108,96,93,104,118,
%U A248616 117,105,125,126,132,112,137,145,132,144,147,126,138,168,141,122,165,185,166,170,187,186
%N A248616 Least number k such that k^k in base n contains all n possible digits.
%C A248616 a(n) is the right diagonal of the triangular array in A239306. Equivalently, a(n) = T(n,n) in A239306.
%H A248616 Vincenzo Librandi, <a href="/A248616/b248616.txt">Table of n, a(n) for n = 1..1700</a>
%t A248616 Join[{1},Table[Module[{k=1},While[Union[IntegerDigits[k^k,n]]!=Range[0, n-1],k++];k],{n,2,70}]] (* _Harvey P. Dale_, Jul 29 2018 *)
%o A248616 (PARI) a(n,b=n)=my(k=1); if(b>1, while(#vecsort(digits(k^k, b), , 8)!=n, k++)); k
%Y A248616 Cf. A239306.
%K A248616 nonn,base
%O A248616 1,2
%A A248616 _Derek Orr_, Oct 09 2014