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.

A111442 Least perfect power of n containing all the distinct digits of n.

This page as a plain text file.
%I A111442 #24 Jun 03 2024 14:26:15
%S A111442 1,32,243,64,25,36,16807,32768,729,100,121,1728,371293,38416,11390625,
%T A111442 1048576,1419857,1889568,893871739,3200000,9261,234256,3404825447,
%U A111442 13824,625,208827064576,729,17210368,24389,24300000,923521,32768,35937,39304,1838265625
%N A111442 Least perfect power of n containing all the distinct digits of n.
%H A111442 James C. McMahon, <a href="/A111442/b111442.txt">Table of n, a(n) for n = 1..1000</a>
%F A111442 a(n) = n^A373203(n). - _Michel Marcus_, Jun 01 2024
%e A111442 a(12) = 1728 = 12^3, as 144=12^2 does not contain 2.
%t A111442 seq={}; Do[k=1;  Until[  ContainsAll[IntegerDigits[n^k],IntegerDigits[n] ],k++  ];AppendTo[seq,n^k] ,{n,35}];seq (* _James C. McMahon_, Jun 01 2024 *)
%o A111442 (PARI) a(n) = my(k=2, d=Set(digits(n))); while(setintersect(Set(digits(n^k)), d) != d, k++); n^k; \\ _Michel Marcus_, Jun 03 2024
%Y A111442 Cf. A373203.
%K A111442 base,nonn
%O A111442 1,2
%A A111442 _Amarnath Murthy_, Aug 03 2005
%E A111442 More terms from _Harvey P. Dale_, Dec 20 2006