Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095980
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095980 Number of UFU-free Motzkin paths of length n. +0
1
1, 1, 2, 4, 9, 20, 47, 112, 274, 679, 1708, 4341, 11143, 28831, 75135, 197013, 519447, 1376256, 3662327, 9784106, 26232033, 70558313, 190348160 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) = number of Motzkin paths (A001006) of length n that contain no consecutive UFU.

FORMULA

G.f.: (1 - x - x^3 - (1 - 2*x - 3*x^2 + 2*x^3 - 2*x^4 + x^6)^(1/2))/(2*x^2*(1 - x + x^2))

EXAMPLE

a(5) = 20 because, of the 21 Motzkin paths of length 5, only UFUDD contains an occurrence of UFU.

CROSSREFS

Sequence in context: A035084 A058385 A058386 this_sequence A036619 A036620 A036721

Adjacent sequences: A095977 A095978 A095979 this_sequence A095981 A095982 A095983

KEYWORD

nonn

AUTHOR

David Callan (callan(AT)stat.wisc.edu), Jul 16 2004

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research