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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A353582 a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4) - 1, with a(0) = 0 = a(1), a(2) = 2, and a(3) = 3. 1
 0, 0, 2, 3, 5, 13, 33, 78, 186, 450, 1088, 2625, 6335, 15295, 36927, 89148, 215220, 519588, 1254398, 3028383, 7311161, 17650705, 42612573, 102875850, 248364270, 599604390, 1447573052, 3494750493, 8437074035, 20368898563, 49174871163, 118718640888, 286612152936, 691942946760 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Paul K. Stockmeyer, Table of n, a(n) for n = 0..1000 Andreas M. Hinz and Paul K. Stockmeyer, Precious Metal Sequences and Sierpinski-Type Graphs, J. Integer Seq., Vol 25 (2022), Article 22.4.8. Index entries for linear recurrences with constant coefficients, signature (3,-2,2,-1,-1). FORMULA a(n) = (1/16)((4-s)*(1+s)^n + (4+s)*(1-s)^n - 8*sin(n*Pi/2) - 12*cos(n*Pi/2) + 4) where s = sqrt(2). G.f.: x^2*(2 - 3*x)/((1 - x)*(1 + x^2)*(1 - 2*x - x^2)). - Stefano Spezia, May 04 2022 CROSSREFS Sequence in context: A072999 A342180 A345076 * A233515 A173268 A141179 Adjacent sequences: A353579 A353580 A353581 * A353583 A353584 A353585 KEYWORD nonn,easy AUTHOR Paul K. Stockmeyer, May 04 2022 STATUS approved

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.

Last modified December 6 10:23 EST 2022. Contains 358630 sequences. (Running on oeis4.)