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.

A236685 Numbers n such that n^A062518(n) is missing more than one digit.

Original entry on oeis.org

14, 17, 43, 57, 75, 78, 93, 102, 138, 139, 149, 152, 165, 167, 176, 177, 196, 228, 248, 253, 265, 276, 289, 347, 351, 352, 357, 382, 395, 424, 430, 432, 437, 438, 449, 455, 456, 462, 477, 489, 492, 502, 511, 554, 570, 605, 634, 649, 656, 679, 682
Offset: 1

Views

Author

Derek Orr, Jan 29 2014

Keywords

Comments

A062518(n) is the maximum power k such that k^n does not contain all ten decimal digits.

Examples

			A062518(43) = 20. And 43^20 = 467056167777397914441056671494001 is missing an 8 and a 2. Thus, 43 is a member of this sequence.
		

Crossrefs

Cf. A062518.

Programs

  • Python
    def PanDigNum(x):
      a = '1234567890'
      lst = []
      if DigitSum(x) == 1:
        return None
      for n in range(-200,0):
        count = 0
        for i in a:
          if str(x**(-n)).count(i) > 0:
            count += 1
          else:
            lst.append(i)
        if count < len(a):
          if len(lst) > 1:
            return x
          else:
            break