Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Oct 16 2024 21:13:52
%S 763,767,1066,1088,1206,1304,1425,1557,1561,1634,1653,1712,1739,1782,
%T 1818,1839,1866,1878,1975,2032,2045,2055,2134,2192,2232,2233,2299,
%U 2318,2339,2347,2358,2425,2441,2489,2509,2511,2575,2646,2682,2692
%N Numbers k such that every digit occurs at least once in k^4.
%H Lars Blomberg, <a href="/A121321/b121321.txt">Table of n, a(n) for n = 1..10000</a>
%e 763^4 = 338920744561 contains every digits at least once.
%t Select[Range[2692],ContainsAll[IntegerDigits[#^4],Range[0,9]]&] (* _James C. McMahon_, Oct 16 2024 *)
%o (Magma) [ n: n in [0..2695] | Seqset(Intseq(n^4)) eq {0..9} ]; // _Bruno Berselli_, May 17 2011
%o (PARI) isok(k) = #Set(digits(k^4)) == 10;
%Y Cf. A119735 (in k^3), A054038 (in k^2).
%K nonn,base
%O 1,1
%A _Tanya Khovanova_, Aug 25 2006