cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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

Views

Author

Derek Orr, Sep 30 2014

Keywords

Comments

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.

Examples

			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.

Crossrefs

Cf. A000312, A054039, A247794, A239306.

Programs

  • PARI
    a(n)=k=1; while(#vecsort(digits(k^k), , 8)!=n, k++); k
vector(10,n,a(n))
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.