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.
%I A020340 #15 Jun 14 2021 15:44:14 %S A020340 36,4,378225,7056,14393520729,16,9,557904400,1322314049613223140496, %T A020340 36,613401598811409576100,321418490709904,837225,16, %U A020340 7535664872989640713426833504575377836025,36,16900,100,7112889 %N A020340 Least square base n doublet (written in base 10). %C A020340 In Bridy et al. it is shown how to construct infinitely many examples for any given base n >= 2. - _Jeffrey Shallit_, Jun 14 2021 %D A020340 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. %D A020340 David Wells, "The Penguin Dictionary of Curious and Interesting Numbers", Revised Edition 1997, p. 189. %H A020340 Andrew Bridy, Robert J. Lemke Oliver, Arlo Shallit, and Jeffrey Shallit, <a href="https://arxiv.org/abs/1707.03894">The Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations</a>, preprint arXiv:1707.03894 [math.NT], July 14 2017. %H A020340 A. Ottens, <a href="https://web.archive.org/web/20041013050849/http://rec-puzzles.org:80/sol.pl/arithmetic/digits/squares/three.digits">The arithmetic-digits-squares-three.digits problem</a> %Y A020340 Cf. A020339, A054214, A054215, A054216, A030465, A030466, A030467. %K A020340 base,nonn %O A020340 2,1 %A A020340 _David W. Wilson_