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.

A054033 Numbers n such that n^2 contains exactly 5 different digits.

Original entry on oeis.org

113, 116, 117, 118, 124, 126, 128, 133, 134, 136, 137, 142, 144, 147, 148, 152, 153, 154, 169, 172, 174, 175, 176, 178, 179, 181, 186, 189, 191, 193, 195, 196, 198, 199, 203, 209, 213, 214, 217, 219, 224, 226, 228, 232, 233, 248, 252, 259, 267, 268, 269
Offset: 1

Views

Author

Asher Auel, Feb 29 2000

Keywords

Comments

The first 66 terms are the only ones whose squares contain no repeated digits. - Charles R Greathouse IV, Feb 09 2015

Crossrefs

Programs

  • Maple
    f := []; for i from 0 to 200 do if nops({op(convert(i^2,base,10))})=5 then f := [op(f),i] fi; od; f;
  • Mathematica
    Select[Range[101,500],Count[DigitCount[#^2],0]==5&] (* Harvey P. Dale, Feb 08 2015 *)
  • PARI
    is(n)=#Set(digits(n^2))==5 \\ Charles R Greathouse IV, Feb 08 2015