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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073155 Left-most column sequence of triangle A073153. 4
1, 1, 4, 14, 56, 237, 1046, 4762, 22198, 105430, 508384, 2482297, 12248416, 60980875, 305955356, 1545397464, 7852100294, 40105277640, 205798130604, 1060467961508, 5485199090812, 28469067353686, 148220323891460 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

REFERENCES

N. S. S. Gu, N. Y. Li and T. Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221.

FORMULA

Convolution of sequence formed from sum of adjacent terms yields the original sequence minus the first term: a(n+1)=sum{k=0..n} [a(k)+a(k-1)]* [a(n-k)+a(n-k-1)], where a(-1)=0.

G.f.: 1/2*(1-(1-4*x*(1+x)^2)^(1/2))/x/(1+x)^2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 10 2003

a(n)=sum{k=0..n, C(2k,n-k)*C(k)} - Paul Barry (pbarry(AT)wit.ie), Jul 09 2006

EXAMPLE

a(3)=a(0)*[a(2)+a(1)]+[a(1)+a(0)]*[a(1)+a(0)]+[a(2)+a(1)]*a(0) =1*[4+1] + [1+1]*[1+1] + [4+1]*1 = 5 + 2*2 + 5 = 14.

CROSSREFS

Cf. A073153, A073156, A073157.

Sequence in context: A143406 A132837 A149491 * A006212 A126701 A151884

Adjacent sequences:  A073152 A073153 A073154 * A073156 A073157 A073158

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 29 2002

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 10 2003

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 17:48 EST 2012. Contains 205939 sequences.