login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095980 Number of UFU-free Motzkin paths of length n. 0
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; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

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 * A036619 A036620 A036721

Adjacent sequences:  A095977 A095978 A095979 * A095981 A095982 A095983

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:07 EST 2012. Contains 205904 sequences.