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.

Showing 1-2 of 2 results.

A110816 Squares corresponding to the terms of A110815.

Original entry on oeis.org

4, 289, 20736, 2093809, 200052736, 20020552036, 2000566963396, 200056526609956, 20002760007280996, 2000558796577898769, 200028505600685288569, 20002759756665062776996
Offset: 1

Views

Author

Lekraj Beedassy, Aug 17 2005

Keywords

Comments

Subsequence of A029784. - Lekraj Beedassy, Oct 07 2005

Extensions

a(3) to a(6) corrected, a(7) to a(13) from Klaus Brockhaus, Aug 31 2005. Revised Sep 09 2005.

A112321 Least n-digit number whose square is exclusionary, or 0 if no such number exists.

Original entry on oeis.org

2, 17, 157, 1547, 15094, 203879, 0, 0, 0
Offset: 1

Views

Author

Lekraj Beedassy and Klaus Brockhaus, Sep 08 2005

Keywords

Comments

m has an exclusionary square if m consists of distinct digits and m^2 is made up only of digits not appearing in m.
a(10) = 0 since 10-digit numbers either use all digits or at least one digit more than once; a(n) = 0 for n > 10 since numbers with more than 10 digits use at least one digit more than once.

References

  • H. Ibstedt, Solution to Problem 2623 "Exclusionary Powers", Journal of Recreational Mathematics pp. 346-9 Vol. 32 no. 4 2003-4 Baywood NY.

Crossrefs

Cf. A112322 (corresponding squares), A110815.
Showing 1-2 of 2 results.