Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114693 Number of returns to the x-axis in all hill-free Schroeder paths of length 2n+4. A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. +0
2
2, 10, 48, 232, 1138, 5666, 28592, 145984, 752978, 3918282, 20547456, 108482952, 576187554, 3076640898, 16506527392, 88938911296, 481067145826, 2611212958154, 14218923060752, 77653486423528, 425227486222482 (list; graph; listen)
OFFSET

0,1

COMMENT

a(n)=sum(k*A114692(n+2,k),k=0..1+floor(n/2)).

FORMULA

G.f.=2[1-3z-sqrt(1-6z+z^2)]/[z(1+z+sqrt(1-6z+z^2)]^2.

EXAMPLE

a(0)=2 because in the three hill-free Schroeder paths of length 4, namely HH, UH(D) and UUD(D), we have altogether 2 returns to the x-axis (shown between parentheses).

MAPLE

G:=2*(1-3*z-sqrt(1-6*z+z^2))/z^2/(1+z+sqrt(1-6*z+z^2))^2:Gser:=series(G, z=0, 30): 2, seq(coeff(Gser, z^n), n=1..23);

CROSSREFS

Cf. A114692.

Sequence in context: A116194 A054138 A065982 this_sequence A121950 A086853 A036918

Adjacent sequences: A114690 A114691 A114692 this_sequence A114694 A114695 A114696

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 26 2005

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research