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.

A020340 Least square base n doublet (written in base 10).

Original entry on oeis.org

36, 4, 378225, 7056, 14393520729, 16, 9, 557904400, 1322314049613223140496, 36, 613401598811409576100, 321418490709904, 837225, 16, 7535664872989640713426833504575377836025, 36, 16900, 100, 7112889
Offset: 2

Views

Author

Keywords

Comments

In Bridy et al. it is shown how to construct infinitely many examples for any given base n >= 2. - Jeffrey Shallit, Jun 14 2021

References

  • Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, and Jeffrey Shallit, The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations, Experimental Math, 28 (2019), 428-439.
  • David Wells, "The Penguin Dictionary of Curious and Interesting Numbers", Revised Edition 1997, p. 189.

Crossrefs