A239306 -id:A239306 - cp's OEIS frontend

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

Derek Orr, Oct 09 2014

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

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

Cf. A239306.

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

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

A248077 Least number k > 0 such that k^k contains exactly n distinct digits.

Original entry on oeis.org

1, 3, 4, 5, 7, 14, 9, 11, 13, 19

Offset: 1

Derek Orr, Sep 30 2014

Unlike A054039 and A247794, "...at least n..." and "...exactly n..." are two different sequences. a(n) above gives "...exactly n..." whereas, for "...at least n...", the sequence would be 1, 3, 4, 5, 7, 9, 9, 11, 13, 19, where a(6) would be 9 instead of 14.

			7^7 = 823543 has 5 distinct digits. 6^6, 5^5, 4^4, 3^3, 2^2, and 1^1 all do not have 5 distinct digits. So a(5) = 7.

Cf. A000312, A054039, A247794, A239306.

a(n)=k=1; while(#vecsort(digits(k^k), , 8)!=n, k++); k
vector(10,n,a(n))

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI