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!)
A100139 a(n) = Sum_{k=0..floor(n/6)} C(n-3k,3k) * 3^k * 2^(n-6k). 3
1, 2, 4, 8, 16, 32, 67, 152, 376, 992, 2704, 7424, 20233, 54398, 144112, 376736, 974368, 2500544, 6385435, 16264220, 41396788, 105423776, 268818064, 686499008, 1755723793, 4495691834, 11521647916, 29543647160, 75774096832, 194353495424 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of 1,1,1,1,1,1,4,4,13,13,31,... with g.f. (1-x)^2(1+x)^3/(1-3x^2+3x^4-4x^6)=(1+x)(1-x^2)^2/((1-x^2)^3-3x^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,3).

FORMULA

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

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

MATHEMATICA

LinearRecurrence[{6, -12, 8, 0, 0, 3}, {1, 2, 4, 8, 16, 32}, 30] (* Harvey P. Dale, Sep 30 2015 *)

CROSSREFS

Cf. A097122, A100133, A100134, A100137, A100138.

Sequence in context: A100138 A336010 A180208 * A274860 A076766 A344492

Adjacent sequences:  A100136 A100137 A100138 * A100140 A100141 A100142

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 18 19:31 EDT 2021. Contains 348069 sequences. (Running on oeis4.)