reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
R. Sprugnoli, <a href="https://web.archive.org/web/20170401103408/http, Section 5.6</a> , CreateSpace Independent Publishing Platform 2006, Section 5.6, ISBN-13: 978-1502925244.
P. Peter Bala, <a href="/A264772/a264772_1.pdf">A 4-parameter family of embedded Riordan arrays</a>
E. Lebensztayn, <a href="httphttps://www.dmtcsdoi.org/dmtcs-ojs/index10.php46298/dmtcs/article/view/1517.512">On the asymptotic enumeration of accessible automata, Section 2</a>, Discrete Mathematics and Theoretical Computer Science, Vol. 12, No.3, 2010, 75-80, Section 2.
R. Sprugnoli, <a href="http://www.dsi.unifi.it/~resp/Handbook.pdf">An Introduction to Mathematical Methods in Combinatorics, Section 5.6</a> CreateSpace Independent Publishing Platform 2006, ISBN-13: 978-1502925244.
O.g.f. : f(x)/(1 - t*x*g(x)), where f(x) = Sum_{n >= 0} binomial(3*n,n)*x^n and g(x) = Sum_{n >= 0} 1/(2*n + 1)*binomial(3*n,n)*x^n.
approved
editing
(MAGMAMagma) /* As triangle */ [[Binomial(3*n-2*k, n-k): k in [0..n]]: n in [0.. 10]]; // Vincenzo Librandi, Dec 02 2015
proposed
approved
editing
proposed
Michael De Vlieger, <a href="/A264772/b264772.txt">Table of n, a(n) for n = 0..11475</a>
Paul Barry, <a href="https://arxiv.org/abs/1906.06373">On the halves of a Riordan array and their antecedents</a>, arXiv:1906.06373 [math.CO], 2019.
approved
editing
proposed
approved