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.

A154873 Numbers n such that n^5 contains every digit exactly 3 times.

This page as a plain text file.
%I A154873 #6 May 01 2021 10:02:37
%S A154873 643905,680061,720558,775113,840501,878613,984927
%N A154873 Numbers n such that n^5 contains every digit exactly 3 times.
%C A154873 a(5) is also the number of A074205
%e A154873 840501^5=419460598737334268928156702501, which contains exactly 3 times of each digit 0-9. Total 7 terms
%t A154873 Select[Range[630972,999978],Union[DigitCount[#^5]]=={3}&] (* _Harvey P. Dale_, May 01 2021 *)
%Y A154873 A054038 A074205 A154532 A154566 A154818
%K A154873 base,easy,full,nonn,fini
%O A154873 1,1
%A A154873 _Zhining Yang_, Jan 16 2009