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!)
A178936 a(n) = floor((2*3^n+3*2^n)/5). 3
1, 2, 6, 15, 42, 116, 330, 951, 2778, 8180, 24234, 72087, 215034, 642644, 1923018, 5759223, 17258010, 51734708, 155125482, 465219159, 1395342906, 4185399572, 12554940426, 37662304695, 112981880922, 338935576436, 1016786596650, 3050319524631, 9150878043258 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: (1-3*x+2*x^2-3*x^3+2*x^4-x^5)/(1-5*x+6*x^2-x^4+5*x^5-6*x^6) = (1-3*x+2*x^2-3*x^3+2*x^4-x^5)/((1-2*x)*(1-3*x)*(1-x^4)).
Recurrence: a(n+6) = 5*a(n+5)-6*a(n+4)+a(n+2)-5*a(n+1)+6*a(n).
a(n) = (8*3^n+12*2^n-(1-(-1)^n)*(5+i^(n+1)))/20, where i=sqrt(-1). - Bruno Berselli, Sep 05 2011
PROG
(Maxima) makelist(floor((2*3^n+3*2^n)/5), n, 0, 12);
(Magma) [Floor((2*3^n+3*2^n)/5): n in [0..30]]; // Vincenzo Librandi, Sep 06 2011
CROSSREFS
Sequence in context: A280782 A307308 A065178 * A221744 A338861 A340726
KEYWORD
nonn,easy
AUTHOR
Emanuele Munarini, Dec 30 2010
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 29 05:33 EDT 2024. Contains 372921 sequences. (Running on oeis4.)