login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075411 Squares of A002276. 9

%I #12 Sep 08 2022 08:45:07

%S 0,4,484,49284,4937284,493817284,49382617284,4938270617284,

%T 493827150617284,49382715950617284,4938271603950617284,

%U 493827160483950617284,49382716049283950617284,4938271604937283950617284,493827160493817283950617284,49382716049382617283950617284

%N Squares of A002276.

%C A transformation of the Wonderful Demlo numbers (A002477).

%H Vincenzo Librandi, <a href="/A075411/b075411.txt">Table of n, a(n) for n = 0..200</a>

%H G. Villemin, <a href="http://villemin.gerard.free.fr/Wwwgvmm/Addition/P100a500/Carrerep.htm">Variations sur les carrés</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000).

%F a(n) = A002276(n)^2 = (2 * A002275(n) )^2 = 4 * (A002275(n) )^2.

%F From _Chai Wah Wu_, Apr 24 2017: (Start)

%F a(n) = 111*a(n-1) - 1110*a(n-2) + 1000*a(n-3) for n > 2.

%F G.f.: 4*x*(1 + 10*x)/((1 - x)*(1 - 10*x)*(1 - 100*x)).

%F (End)

%F a(n) = 4*(10^n - 1)^2/81. - _Colin Barker_, Apr 25 2017

%e a(2) = 22^2 = 484.

%t LinearRecurrence[{111, -1110, 1000}, {0, 4, 484}, 30] (* _Vincenzo Librandi_, Apr 25 2017 *)

%o (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 Cf. A075411, A075412, A075413, A075414, A075415, A075416, A075417, A002283.

%K easy,nonn

%O 0,2

%A Michael Taylor (michael.taylor(AT)vf.vodafone.co.uk), Sep 14 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)