Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051485 Number of double nodes (exactly two nodes on that level) for all Motzkin paths of length n. +0
1
0, 1, 1, 2, 6, 14, 32, 74, 180, 457, 1195, 3177, 8526, 23018, 62441, 170153 (list; graph; listen)
OFFSET

0,4

REFERENCES

Wen-jin Woan, "Unilevel Points Via Generating Functions", preprint, 1999.

EXAMPLE

Of the 9 Motzkin paths of length 4 the following 5 have a total of 6 double nodes:

|1......|

|2../\..|3..__..|2.._...|2..._..|2......|

|2./..\.|2./..\.|3./.\_.|3._/.\.|3./\/\.|

CROSSREFS

Sequence in context: A074878 A065495 A131352 this_sequence A077999 A110524 A083404

Adjacent sequences: A051482 A051483 A051484 this_sequence A051486 A051487 A051488

KEYWORD

nonn

AUTHOR

Wen-jin Woan (wwoan(AT)howard.edu)

EXTENSIONS

Edited by Michael Somos, Sep 29, 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