Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101891 Sum C(n,2k)F(k+1), k=0..floor(n/2). +0
1
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; listen)
OFFSET

0,3

COMMENT

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,...

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.

Adjacent sequences: A101888 A101889 A101890 this_sequence A101892 A101893 A101894

Sequence in context: A084634 A137256 A051164 this_sequence A119967 A052921 A018905

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 20 2004

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research