Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127359
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127359 a(n)=sum{k=0..n, C(n,floor(k/2))*3^(n-k)}. +0
4
1, 4, 14, 48, 162, 544, 1820, 6080, 20290, 67680, 225684, 752448, 2508468, 8362176, 27875064, 92919168, 309734850, 1032458080, 3441543140, 11471842880 (list; graph; listen)
OFFSET

0,2

COMMENT

Hankel transform is (-2)^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-3x) 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-3*x*c(x^2))

CROSSREFS

Cf. A107430 [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 16 2009]

Sequence in context: A022632 A027906 A047135 this_sequence A007070 A092489 A094827

Adjacent sequences: A127356 A127357 A127358 this_sequence A127360 A127361 A127362

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research