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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119367 Number of rooted planar n-trees whose number of leaves is equal to 2 modulo 3. 2
0, 0, 1, 3, 6, 11, 30, 126, 519, 1836, 5877, 18866, 65472, 242463, 905425, 3307371, 11889414, 42930441, 157641714, 586908936, 2194106568, 8189323686, 30541703733, 114219616809, 429214875498, 1619584557885, 6125465491551 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

a(n)+A119365(n)+A119366(n)=A000108(n).

FORMULA

a(n)=sum{k=0..n, if(mod(n-k,3)=2, (1/n)*C(n,k)*C(n,k+1), 0)}.

CROSSREFS

Sequence in context: A109781 A101958 A153982 * A079801 A119104 A180483

Adjacent sequences:  A119364 A119365 A119366 * A119368 A119369 A119370

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 16 2006

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 14 23:04 EST 2012. Contains 205686 sequences.