Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127358
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127358 a(n)=sum{k=0..n, C(n,floor(k/2))*2^(n-k)}. +0
7
1, 3, 8, 21, 54, 138, 350, 885, 2230, 5610, 14088, 35346, 88596, 221952, 555738, 1391061, 3480870, 8708610, 21783680, 54483510, 136254964, 340729788, 852000828, 2130354786, 5326563004 (list; graph; listen)
OFFSET

0,2

COMMENT

Hankel transform is (-1)^n. In general, given r>=0, the sequence given by sum{k=0..n, C(n,floor(k/2))*r^(n-k)} has Hankel transform (1-r)^n. The sequence is the image of the sequence with g.f. (1+x)/(1-2x) under the Chebyshev mapping g(x)->(1/sqrt(1-4x^2))g(xc(x^2)), where c(x) is the g.f. of the Catalan numbers A000108.

FORMULA

G.f.: (1/sqrt(1-4x^2))(1+x*c(x^2))/(1-2*x*c(x^2))

a(n)=2*a(n-1)+A054341(n-1). a(n)=Sum_{k, 0<=k<=n}A126075(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 03 2007

CROSSREFS

Sequence in context: A030015 A103446 A094723 this_sequence A077849 A135473 A005580

Adjacent sequences: A127355 A127356 A127357 this_sequence A127359 A127360 A127361

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 11 2007

page 1

Search completed in 0.002 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research