A248616 Least number k such that k^k in base n contains all n possible digits.

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, 62, 73, 65, 67, 62, 70, 77, 77, 74, 76, 95, 92, 103, 97, 91, 89, 108, 96, 93, 104, 118, 117, 105, 125, 126, 132, 112, 137, 145, 132, 144, 147, 126, 138, 168, 141, 122, 165, 185, 166, 170, 187, 186

Offset: 1

Author

Derek Orr, Oct 09 2014

Keywords

• nonn
• base

Comments

a(n) is the right diagonal of the triangular array in A239306. Equivalently, a(n) = T(n,n) in A239306.

Links

• Vincenzo Librandi, Table of n, a(n) for n = 1..1700

Crossrefs

Cf. A239306.

Programs

Mathematica

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 *)

PARI

a(n,b=n)=my(k=1); if(b>1, while(#vecsort(digits(k^k, b), , 8)!=n, k++)); k