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!)
A106707 a(n) = -A001353(n). 5

%I #35 Feb 24 2024 01:11:11

%S 0,-1,-4,-15,-56,-209,-780,-2911,-10864,-40545,-151316,-564719,

%T -2107560,-7865521,-29354524,-109552575,-408855776,-1525870529,

%U -5694626340,-21252634831,-79315912984,-296011017105,-1104728155436,-4122901604639,-15386878263120,-57424611447841

%N a(n) = -A001353(n).

%H G. C. Greubel, <a href="/A106707/b106707.txt">Table of n, a(n) for n = 0..1000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-1).

%F G.f.: -x/(1-4*x+x^2).

%F a(n) = 4*a(n-1) - a(n-2); a(0)=0, a(1)=-1.

%p a[0]:=0: a[1]:=-1: for n from 2 to 27 do a[n]:=4*a[n-1]-a[n-2] od: seq(a[n],n=0..27);

%t LinearRecurrence[{4,-1},{0,-1},30] (* _Harvey P. Dale_, Nov 01 2019 *)

%o (PARI) x='x+O('x^30); Vec(-x/(1-4*x+x^2)) \\ _G. C. Greubel_, Feb 05 2018

%o (Magma) I:=[0,-1]; [n le 2 select I[n] else 4*Self(n-1) - Self(n-2): n in [1..30]]; // _G. C. Greubel_, Feb 05 2018

%Y Cf. A001076, A001353.

%K sign,easy,less

%O 0,3

%A _Roger L. Bagula_, May 30 2005

%E Edited by _N. J. A. Sloane_, Apr 30 2006

%E New name from _Joerg Arndt_, Sep 22 2023

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 May 5 12:29 EDT 2024. Contains 372275 sequences. (Running on oeis4.)