This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A117671 #40 Oct 11 2017 05:22:55
%S A117671 1,6,35,210,1287,8008,50388,319770,2042975,13123110,84672315,
%T A117671 548354040,3562467300,23206929840,151532656696,991493848554,
%U A117671 6499270398159,42671977361650,280576272201225
%N A117671 a(n) = binomial(3*n+1, n+1).
%C A117671 a(n) = A258993(2*n+1, n). - _Reinhard Zumkeller_, Jun 22 2015
%H A117671 Reinhard Zumkeller, <a href="/A117671/b117671.txt">Table of n, a(n) for n = 0..1000</a>
%H A117671 Milan Janjic, <a href="http://www.pmfbl.org/janjic/">Two Enumerative Functions</a>
%F A117671 G.f.: (2*(-1+Hypergeometric2F1[-(1/3),1/3,-(1/2),(27*x)/4]))/(3*x). - _Harvey P. Dale_, Jul 19 2011
%F A117671 G.f.: A(x) = B'(x)/B(x)-B'(x)-1/x, where B(x) = 4/3*sin(1/3*asin(sqrt((27*x)/4)))^2. - _Vladimir Kruchinin_, Nov 26 2014
%F A117671 From _Peter Bala_, Nov 04 2015: (Start)
%F A117671 With an extra initial term equal to 1, the o.g.f. equals f(x)/g(x)^2, where f(x) is the o.g.f. for A005809 and g(x) is the o.g.f. for A001764.
%F A117671 More generally, f(x)*g(x)^k is the o.g.f. for the sequence binomial(3*n + k,n). Cf. A045721 (k = 1), A025174 (k = 2), A004319 (k = 3), A236194 (k = 4), A013698 (k = 5), A165817 (k = -1). (End)
%F A117671 a(n) = [x^(2*n)] 1/(1 - x)^(n+2). - _Ilya Gutkovskiy_, Oct 10 2017
%F A117671 a(n+1) = 3*(3*n+2)*(3*n+4)*a(n)/(2*(n+2)*(2*n+1)). - _Robert Israel_, Oct 10 2017
%e A117671 if n=0 then C(3*0+1,0+1) = C(1,1) = 1.
%e A117671 if n=10 then C(3*10+1,10+1) = C(31,11) = 84672315.
%p A117671 seq(binomial(3*n+1,n+1),n=0..30); # _Robert Israel_, Oct 10 2017
%t A117671 Table[Binomial[3n+1,n+1],{n,0,20}] (* _Harvey P. Dale_, Jul 19 2011 *)
%o A117671 (Haskell)
%o A117671 a117671 n = a258993 (2 * n + 1) n -- _Reinhard Zumkeller_, Jun 22 2015
%o A117671 (PARI) vector(30, n, n--; binomial(3*n+1, n+1)) \\ _Altug Alkan_, Nov 04 2015
%Y A117671 Cf. A025174: binomial(3n-1,n-1), A006013.
%Y A117671 Cf. A258993, A001764, A004319, A005809, A013698, A045721, A165817, A236194.
%K A117671 nonn,easy
%O A117671 0,2
%A A117671 _Zerinvary Lajos_, Apr 12 2006