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!)
A101891 Sum C(n,2k)F(k+1), k=0..floor(n/2). 0
1, 1, 2, 4, 9, 21, 49, 113, 258, 586, 1329, 3015, 6845, 15549, 35330, 80280, 182413, 414461, 941669, 2139477, 4860898, 11044006, 25092157, 57009871, 129527609, 294289401, 668631458, 1519143916, 3451524785, 7841931877, 17817022873 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Transform of F(n+1) under the mapping g(x)-> (1/(1-x))g(x^2/((1-x)^2). Binomial transform of 1,0,1,0,2,0,3,0,5,...

LINKS

Table of n, a(n) for n=0..30.

Index entries for linear recurrences with constant coefficients, signature (4,-5,2,1)

FORMULA

G.f.: (1-x)^3/(1-4x+5x^2-2x^3-x^4); a(n)=4a(n-1)-5a(n-2)+2a(n-3)+a(n-4); a(n)=sum{k=0..n, binomial(n, k)(F((k+2)/2)(1+(-1)^k)/2}.

CROSSREFS

Cf. A000045.

Sequence in context: A051164 A182904 A281425 * A119967 A266232 A052921

Adjacent sequences:  A101888 A101889 A101890 * A101892 A101893 A101894

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Dec 20 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 September 26 18:49 EDT 2020. Contains 337374 sequences. (Running on oeis4.)