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.
%I A199634 #13 Aug 23 2023 13:35:39
%S A199634 3265920,534,74,13,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A199634 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A199634 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A199634 Number of pandigital numbers raised to the n-th power is a number in which each digit appears n times.
%C A199634 Note that a(1) is the number of pandigital numbers, 10! - 9! = 9*9!. For n > 1, it is the number of numbers in A199630, A199631, A365144, A199632, and A199633.
%C A199634 The Mathematica code takes many hours to run. The program stops after doing power 186 because the largest pandigital number 9876543210 raised to any greater power does not produce enough digits.
%H A199634 Patrick De Geest, <a href="http://www.worldofnumbers.com/ninedig4.htm">The nine digits (page 4) with some ten digit (pandigital) exceptions</a>
%H A199634 Author?, <a href="http://web.archive.org/web/20080708203024/http://blue.kakiko.com/mmrmmr/htm/eqtn11.html">All terms</a>
%t A199634 t = {}; perm = Select[Permutations[Range[0, 9]], #[[1]] > 0 &]; len = Length[perm]; Print[{1, len}]; AppendTo[t, len]; pwr = 1; i = 1; While[pwr++; i < len, While[IntegerLength[FromDigits[perm[[i]]]^pwr] < 10*pwr, i++]; cnt = 0; Do[If[Union[DigitCount[FromDigits[perm[[j]]]^pwr]] == {pwr}, cnt++], {j, i, len}]; Print[{pwr, cnt}]; AppendTo[t, cnt]]
%Y A199634 Cf. A050278 (pandigital numbers), A199630, A199631, A365144, A199632, A199633.
%K A199634 nonn,base
%O A199634 1,1
%A A199634 _T. D. Noe_, Nov 09 2011