The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A050935 a(1)=0, a(2)=0, a(3)=1, a(n+1) = a(n) - a(n-2). 15

%I #30 Jun 18 2023 23:58:40

%S 0,0,1,1,1,0,-1,-2,-2,-1,1,3,4,3,0,-4,-7,-7,-3,4,11,14,10,-1,-15,-25,

%T -24,-9,16,40,49,33,-7,-56,-89,-82,-26,63,145,171,108,-37,-208,-316,

%U -279,-71,245,524,595,350,-174,-769,-1119,-945,-176,943,1888,2064,1121,-767,-2831,-3952

%N a(1)=0, a(2)=0, a(3)=1, a(n+1) = a(n) - a(n-2).

%C The Ze3 sums, see A180662, of triangle A108299 equal the terms of this sequence without the two leading zeros. [Johannes W. Meijer, Aug 14 2011]

%D R. Palmaccio, "Average Temperatures Modeled with Complex Numbers", Mathematics and Informatics Quarterly, pp. 9-17 of Vol. 3, No. 1, March 1993.

%H Reinhard Zumkeller, <a href="/A050935/b050935.txt">Table of n, a(n) for n = 1..10000</a>

%H José L. Ramírez, Víctor F. Sirvent, <a href="http://ami.ektf.hu/uploads/papers/finalpdf/AMI_45_from91to105.pdf">A note on the k-Narayana sequence</a>, Annales Mathematicae et Informaticae, 45 (2015) pp. 91-105.

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

%F G.f. : x^2/(1-x+x^3); a(n+2) = sum{k=0..floor(n/3), binomial(n-2*k, k)*(-1)^k)} - _Paul Barry_, Oct 20 2004

%F G.f.: Q(0)*x^2/2 , where Q(k) = 1 + 1/(1 - x*(12*k-1 + x^2)/( x*(12*k+5 + x^2 ) - 1/Q(k+1) )); (continued fraction). - _Sergei N. Gladkovskii_, Sep 12 2013

%p A050935 := proc(n) option remember; if n <= 1 then 0 elif n = 2 then 1 else A050935(n-1)-A050935(n-3); fi; end: seq(A050935(n), n=0..61);

%t LinearRecurrence[{1,0,-1},{0,0,1},70] (* _Harvey P. Dale_, Jan 30 2014 *)

%o (Haskell)

%o a050935 n = a050935_list !! (n-1)

%o a050935_list = 0 : 0 : 1 : zipWith (-) (drop 2 a050935_list) a050935_list

%o -- _Reinhard Zumkeller_, Jan 01 2012

%o (PARI) a(n)=([0,1,0; 0,0,1; -1,0,1]^(n-1)*[0;0;1])[1,1] \\ _Charles R Greathouse IV_, Feb 06 2017

%Y When run backwards this gives a signed version of A000931.

%Y Cf. A099529.

%Y Apart from signs, essentially the same as A078013.

%Y Cf. A203400 (partial sums).

%K easy,nice,sign

%O 1,8

%A Richard J. Palmaccio (palmacr(AT)pinecrest.edu), Dec 31 1999

%E Offset adjusted by _Reinhard Zumkeller_, Jan 01 2012

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 24 08:42 EDT 2024. Contains 372773 sequences. (Running on oeis4.)