The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199634 Number of pandigital numbers raised to the n-th power is a number in which each digit appears n times. 0

%I

%S 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 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 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

%N Number of pandigital numbers raised to the n-th power is a number in which each digit appears n times.

%C 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, A114260, A199632, and A199633.

%C 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 Patrick De Geest, <a href="http://www.worldofnumbers.com/ninedig4.htm">The nine digits (page 4) with some ten digit (pandigital) exceptions</a>

%H Author?, <a href="http://web.archive.org/web/20080708203024/http://blue.kakiko.com/mmrmmr/htm/eqtn11.html">All terms</a>

%t 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 Cf. A050278 (pandigital numbers).

%K nonn,base

%O 1,1

%A _T. D. Noe_, Nov 09 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 30 19:15 EDT 2021. Contains 346359 sequences. (Running on oeis4.)