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.

A154875 Numbers k such that k^4 contains every digit exactly 3 times.

Original entry on oeis.org

17824719, 17940018, 18027474, 18197931, 18326025, 18798396, 18915888, 18929424, 19027455, 19149462, 19180275, 19196064, 19235673, 19311297, 19322913, 19324275, 19328322, 19455918, 19522575, 19757886, 19793664
Offset: 1

Views

Author

Zhining Yang, Jan 16 2009

Keywords

Examples

			22807116 ^ 4 = 270571148920443982076865351936, which contains exactly 3 times of each digit 0-9.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[17824000,31608000],Union[Tally[IntegerDigits[#^4]][[All,2]]]=={3}&] (* Harvey P. Dale, Dec 24 2016 *)
  • PARI
    is(n) = my(v=vector(10), d=digits(n^4)); if(#d!=30,return(0)); for(i=1, #d, v[d[i]+1]++; if(v[d[i]+1] > 3, return(0))); 1 \\ David A. Corneth, Aug 19 2025