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!)
A051794 a(n) = Sum_{i=n-6..n-1} (-1)^i * a(i), a(1)=1, a(2)=1, a(3)=1, a(4)=1, a(5)=1, a(6)=1. 1

%I #15 Jan 31 2021 20:26:49

%S 1,1,1,1,1,1,0,1,1,1,1,1,1,0,-1,1,1,1,1,1,2,-1,-3,1,1,1,1,2,5,-3,-7,1,

%T 1,1,0,5,13,-7,-15,1,1,0,-5,13,33,-15,-31,1,2,-5,-23,33,81,-31,-63,2,

%U 9,-23,-79,81,193,-63,-128,9,41,-79,-239,193,449,-128,-265,41,161,-239

%N a(n) = Sum_{i=n-6..n-1} (-1)^i * a(i), a(1)=1, a(2)=1, a(3)=1, a(4)=1, a(5)=1, a(6)=1.

%C Same as the 12th-order equation given in the Mathematica program. - _T. D. Noe_, Feb 22 2012

%H T. D. Noe, <a href="/A051794/b051794.txt">Table of n, a(n) for n = 1..1000</a>

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

%F G.f.: -x*(x^2-x+1)*(x^2+x+1)*(2*x^7+x^6+x^5+x^4+x^3+x^2+x+1) / (x^12+x^10+x^8-x^6-x^4-x^2-1). - _Colin Barker_, Mar 17 2015

%t LinearRecurrence[{0, -1, 0, -1, 0, -1, 0, 1, 0, 1, 0, 1}, {1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1}, 100] (* _T. D. Noe_, Feb 22 2012 *)

%o (PARI) Vec(-x*(x^2-x+1)*(x^2+x+1)*(2*x^7+x^6+x^5+x^4+x^3+x^2+x+1) / (x^12+x^10+x^8-x^6-x^4-x^2-1) + O(x^100)) \\ _Colin Barker_, Mar 17 2015

%K easy,nice,sign

%O 1,21

%A Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 10 1999

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)