The On-Line Encyclopedia of Integer Sequences (OEIS)

A248616 revision #5

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

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

LINKS

Table of n, a(n) for n=1..68.

PROG

(PARI)

a(n, b)=k=1; while(#vecsort(digits(k^k, b), , 8)!=n, if(#digits(k^k)>10^(n\2), return(0)); k++); k

print1(1, ", "); b=2; while(b<1000, print1(a(b, b), ", "); b++)

CROSSREFS