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 A075417 #11 Aug 01 2025 00:14:51 %S A075417 0,64,7744,788544,78996544,7901076544,790121876544,79012329876544, %T A075417 7901234409876544,790123455209876544,79012345663209876544, %U A075417 7901234567743209876544,790123456788543209876544,79012345678996543209876544,7901234567901076543209876544,790123456790121876543209876544 %N A075417 Squares of A002282: a(n) = (8*(10^n - 1)/9)^2. %C A075417 A transformation of the Wonderful Demlo numbers (A002477). %H A075417 Colin Barker, <a href="/A075417/b075417.txt">Table of n, a(n) for n = 0..100</a> %H A075417 Gérard Villemin, <a href="http://villemin.gerard.free.fr/Wwwgvmm/Addition/P100a500/Carrerep.htm">Variations sur les carrés</a>. %H A075417 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000). %F A075417 a(n) = A002282(n)^2 = (8*A002275(n))^2 = 64*A002275(n)^2. %F A075417 From _Colin Barker_, Jul 17 2019: (Start) %F A075417 G.f.: 64*x*(1 + 10*x)/((1 - x)*(1 - 10*x)*(1 - 100*x)). %F A075417 a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n>2. %F A075417 a(n) = 64*(10^n-1)^2/81. (End) %F A075417 From _Elmo R. Oliveira_, Jul 30 2025: (Start) %F A075417 E.g.f.: 64*exp(x)*(1 - 2*exp(9*x) + exp(99*x))/81. %F A075417 a(n) = 64*A002477(n). (End) %e A075417 a(2) = 88^2 = 7744. %o A075417 (PARI) concat(0, Vec(64*x*(1 + 10*x) / ((1 - x)*(1 - 10*x)*(1 - 100*x)) + O(x^20))) \\ _Colin Barker_, Jul 17 2019 %Y A075417 Cf. A075411, A075412, A075413, A075414, A075415, A075416, A075417. %Y A075417 Cf. A002275, A002282, A002283, A002477. %K A075417 easy,nonn %O A075417 0,2 %A A075417 Michael Taylor (michael.taylor(AT)vf.vodafone.co.uk), Sep 14 2002