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.

A204691 Numbers n such that n contains exactly 5 digits, all distinct, and n^2 contains exactly 9 distinct digits.

Original entry on oeis.org

10278, 12543, 12586, 13268, 13278, 13698, 14098, 15963, 16549, 16854, 17529, 18072, 19023, 20316, 20513, 20754, 21397, 21439, 23019, 23178, 24807, 25941, 26351, 26409, 27105, 27984, 28346, 28731, 29034, 29106
Offset: 1

Views

Author

Zak Seidov, Jan 18 2012

Keywords

Comments

There are 30 terms (a(30)=29106); the only prime is a(17)=21397.

Crossrefs

Subsequence of A054037.

Programs

  • Mathematica
    Select[Range[10000, Sqrt[10^9]], Length[Union[IntegerDigits[#]]] == 5 && Length[Union[IntegerDigits[#^2]]] == 9 &] (* T. D. Noe, Jan 18 2012 *)