Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050253
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050253 G.f.: ( 1 - x^2 - Sqrt[ 1 - 2 x^2 - 4 x^3 - 3 x^4 ] ) / ( 2 x^3 ). +0
2
1, 1, 1, 2, 3, 5, 9, 16, 29, 54, 101, 191, 365, 702, 1359, 2647, 5181, 10187, 20113, 39856, 79243, 158036, 316053, 633689, 1273559, 2565136, 5177043, 10468199, 21204379, 43022215, 87423573, 177906552, 362531425, 739700055, 1511091377 (list; graph; listen)
OFFSET

0,4

COMMENT

a(n)=number of Motzkin (n-1)-paths (A001006) containing no three consecutive weakly-rising steps (n>=1). A weakly-rising step is an upstep or flatstep. For example, a(5)=5 counts FUDF, UDFF, UDUD, UFDF, UUDD while the path FUFD, say, is not counted because the first 3 steps are weakly-rising. - David Callan (callan(AT)stat.wisc.edu), Oct 25 2004

FORMULA

a(n)=A108296(n+2)-A108296(n). - Paul Barry (pbarry(AT)wit.ie), May 31 2005

G.f.: 1/(1-x-x^3/(1-x^2-x^3/(1-x-x^3/(1-x^2-x^3/(1-x-x^3/(1-... (continued fraction). [From Paul Barry (pbarry(AT)wit.ie), May 25 2009]

CROSSREFS

Sequence in context: A103285 A000049 A000050 this_sequence A107250 A050168 A072176

Adjacent sequences: A050250 A050251 A050252 this_sequence A050254 A050255 A050256

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), May 09 2003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research