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 A091522 #18 Feb 16 2025 08:32:52 %S A091522 5,7,10,14,20,28,40,57,81,115,163,231,327,463,655,927,1311,1854,2622, %T A091522 3708,5244,7416,10488,14832,20976,29665,41953,59331,83907,118663, %U A091522 167815,237326,335630,474653,671261,949307,1342523,1898614,2685046 %N A091522 Graham-Pollak sequence with initial term 5. %H A091522 Seiichi Manyama, <a href="/A091522/b091522.txt">Table of n, a(n) for n = 1..500</a> %H A091522 Th. Stoll, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL8/Stoll/stoll56.html">On Families of Nonlinear Recurrences Related to Digits</a>, Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.2. %H A091522 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Graham-PollakSequence.html">Graham-Pollak Sequence</a> %F A091522 a(n) = floor(sqrt(2) * (a(n-1) + 1/2)). %t A091522 NestList[Floor[Sqrt[2](#+1/2)]&,5,40] (* _Harvey P. Dale_, Feb 24 2018 *) %o A091522 (PARI) first(n)=my(v=vector(n)); v[1]=5; for(k=2,n, v[k]=sqrtint(2*(v[k-1]+1)*v[k-1])); v \\ _Charles R Greathouse IV_, Jan 23 2020 %Y A091522 Cf. A001521, A091523. %K A091522 nonn %O A091522 1,1 %A A091522 _Eric W. Weisstein_, Jan 18 2004