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 A075411 #16 Jul 29 2025 08:39:16 %S A075411 0,4,484,49284,4937284,493817284,49382617284,4938270617284, %T A075411 493827150617284,49382715950617284,4938271603950617284, %U A075411 493827160483950617284,49382716049283950617284,4938271604937283950617284,493827160493817283950617284,49382716049382617283950617284 %N A075411 Squares of A002276. %C A075411 A transformation of the Wonderful Demlo numbers (A002477). %H A075411 Vincenzo Librandi, <a href="/A075411/b075411.txt">Table of n, a(n) for n = 0..200</a> %H A075411 Gérard Villemin, <a href="http://villemin.gerard.free.fr/Wwwgvmm/Addition/P100a500/Carrerep.htm">Variations sur les carrés</a>. %H A075411 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000). %F A075411 a(n) = A002276(n)^2 = (2*A002275(n))^2 = 4*A002275(n)^2. %F A075411 From _Chai Wah Wu_, Apr 24 2017: (Start) %F A075411 a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2. %F A075411 G.f.: 4*x*(1 + 10*x)/((1 - x)*(1 - 10*x)*(1 - 100*x)). (End) %F A075411 a(n) = 4*(10^n - 1)^2/81. - _Colin Barker_, Apr 25 2017 %F A075411 From _Elmo R. Oliveira_, Jul 28 2025: (Start) %F A075411 E.g.f.: 4*exp(x)*(1 - 2*exp(9*x) + exp(99*x))/81. %F A075411 a(n) = 4*A002477(n). (End) %e A075411 a(2) = 22^2 = 484. %t A075411 LinearRecurrence[{111, -1110, 1000}, {0, 4, 484}, 30] (* _Vincenzo Librandi_, Apr 25 2017 *) %o A075411 (Magma) I:=[0,4,484]; [n le 3 select I[n] else 111*Self(n-1)-1110*Self(n-2)+1000*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Apr 25 2017 %Y A075411 Cf. A075411, A075412, A075413, A075414, A075415, A075416, A075417. %Y A075411 Cf. A002275, A002276, A002283, A002477. %K A075411 easy,nonn %O A075411 0,2 %A A075411 Michael Taylor (michael.taylor(AT)vf.vodafone.co.uk), Sep 14 2002