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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275277 a(n) = a(n-1) + 3*a(n-2) + 3*a(n-3) + a(n-4), where a(0) = a(1) = a(2) = a(3) = 1. 1
 1, 1, 1, 1, 8, 15, 43, 113, 295, 778, 2045, 5377, 14141, 37185, 97784, 257139, 676187, 1778141, 4675903, 12296026, 32334345, 85028273, 223595289, 587979169, 1546184200, 4065935847, 10692021243, 28116360553, 73936416023, 194427497258, 511277848229 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Clark Kimberling, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1,3,3,1). FORMULA a(n) = a(n-1) + 3*a(n-2) + 3*a(n-3) + a(n-4), where a(0) = a(1) = a(2) = a(3) = 1. G.f.: (-1 + 3 x^2 + 6 x^3)/(-1 + x + 3 x^2 + 3 x^3 + x^4). MATHEMATICA LinearRecurrence[{1, 3, 3, 1}, {1, 1, 1, 1}, 50] CROSSREFS Cf. A099234. Sequence in context: A253767 A254541 A137658 * A341117 A255428 A216443 Adjacent sequences:  A275274 A275275 A275276 * A275278 A275279 A275280 KEYWORD nonn,easy AUTHOR Clark Kimberling, Aug 11 2016 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 12:27 EST 2022. Contains 350572 sequences. (Running on oeis4.)