This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022318 a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 4. 4
 1, 4, 6, 11, 18, 30, 49, 80, 130, 211, 342, 554, 897, 1452, 2350, 3803, 6154, 9958, 16113, 26072, 42186, 68259, 110446, 178706, 289153, 467860, 757014, 1224875, 1981890, 3206766, 5188657, 8395424 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (2,0,-1). FORMULA From Ron Knott, Aug 25 2006: (Start) a(n) = 2*A000045(n+2) + A000045(n) - 1. G.f.: (1+2*x-2*x^2)/((1-x)*(1-x-x^2)). a(0)=1, a(1)=4, a(2)=6, a(n) = 2*a(n-1) - a(n-3). (End) a(n) - a(n-1) = A013655(n-1). - R. J. Mathar, May 06 2014 MATHEMATICA LinearRecurrence[{2, 0, -1}, {1, 4, 6}, 50] (* G. C. Greubel, Aug 25 2017 *) PROG (PARI) x='x+O('x^50); Vec((1+2*x-2*x^2)/((1-x)*(1-x-x^2))) \\ G. C. Greubel, Aug 25 2017 CROSSREFS Cf. A122195. Sequence in context: A060577 A197985 A058579 * A291916 A047811 A244010 Adjacent sequences:  A022315 A022316 A022317 * A022319 A022320 A022321 KEYWORD nonn AUTHOR STATUS approved

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