login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100138 a(n) = Sum_{k=0..floor(n/6)} C(n-3k,3k) * 2^(n-5k). 4
1, 2, 4, 8, 16, 32, 66, 144, 336, 832, 2144, 5632, 14852, 38968, 101312, 260736, 664704, 1681152, 4226056, 10578080, 26407648, 65838848, 164095360, 409129472, 1020795408, 2549137824, 6371133120, 15935185792, 39878810624, 99837958144 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of 1,1,1,1,1,1,3,3,9,9,21,... with g.f. (1-x)^2(1+x)^2/(1-3x^2+3x^4-3x^6)=(1+x)(1-x^2)^2/((1-x^2)^3-2x^6).

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (6,-12,8,0,0,2).

FORMULA

G.f.: (1-2x)^2/((1-2x)^3 - 2x^6).

a(n) = 6*a(n-1) - 12*a(n-2) + 8*a(n-3) + 2*a(n-6).

MATHEMATICA

Table[Sum[Binomial[n-3k, 3k]2^(n-5k), {k, 0, Floor[n/6]}], {n, 0, 30}] (* or *) LinearRecurrence[{6, -12, 8, 0, 0, 2}, {1, 2, 4, 8, 16, 32}, 30] (* Harvey P. Dale, Dec 30 2019 *)

CROSSREFS

Cf. A052101, A100132, A100134, A100137, A100139.

Sequence in context: A049142 A303023 A308032 * A336010 A180208 A100139

Adjacent sequences:  A100135 A100136 A100137 * A100139 A100140 A100141

KEYWORD

easy,nonn,changed

AUTHOR

Paul Barry, Nov 06 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 17:25 EDT 2021. Contains 348042 sequences. (Running on oeis4.)