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!)
A077938 Expansion of 1/(1-2*x-x^2-2*x^3). 3
1, 2, 5, 14, 37, 98, 261, 694, 1845, 4906, 13045, 34686, 92229, 245234, 652069, 1733830, 4610197, 12258362, 32594581, 86667918, 230447141, 612751362, 1629285701, 4332217046, 11519222517, 30629233482, 81442123573, 216551925662, 575804441861, 1531045056530 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Number of compositions of n into two sorts of parts 1 and 3, and one sort of parts 2. - Joerg Arndt, May 02 2015
LINKS
Paul Barry, The Gamma-Vectors of Pascal-like Triangles Defined by Riordan Arrays, arXiv:1804.05027 [math.CO], 2018.
Sergey Kitaev, Jeffrey Remmel, Mark Tiefenbruck, Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II, Electronic Journal of Combinatorial Number Theory, Volume 15 #A16. (arXiv:1302.2274)
FORMULA
a(n)=sum(k=1..n, sum(j=0..k, binomial(j,n-3*k+2*j)* binomial(k,j)*2^(-n+4*k-2*j))), n>0, a(0)=1. [Vladimir Kruchinin, May 05 2011]
a(n) = 2*a(n-1) + a(n-2) + 2*a(n-3). [Stefan Schuster, Apr 24 2015]
MATHEMATICA
LinearRecurrence[{2, 1, 2}, {1, 2, 5}, 100] (* Vladimir Joseph Stephan Orlovsky, Jul 03 2011 *)
PROG
(Maxima) a(n):=sum(sum(binomial(j, n-3*k+2*j)*binomial(k, j)*2^(-n+4*k-2*j), j, 0, k), k, 1, n); // Vladimir Kruchinin, May 05 2011
(PARI) Vec(1/(1-2*x-x^2-2*x^3)+O(x^99)) \\ Charles R Greathouse IV, Sep 27 2012
CROSSREFS
Absolute values of A077987.
Sequence in context: A099485 A038990 A355387 * A077987 A143141 A117294
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 17 2002
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 12:19 EDT 2024. Contains 372533 sequences. (Running on oeis4.)