cp's OEIS Frontend

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.

A166897 a(n) = Sum_{k=0..[n/2]} C(n-k,k)^3*n/(n-k), n>=1.

This page as a plain text file.
%I A166897 #6 Nov 27 2017 13:19:38
%S A166897 1,3,13,39,126,477,1765,6495,24709,95128,367368,1431453,5620343,
%T A166897 22170543,87858813,349708431,1397003136,5598513261,22502171771,
%U A166897 90681323364,366299212873,1482827487650,6014529069540,24439715146941
%N A166897 a(n) = Sum_{k=0..[n/2]} C(n-k,k)^3*n/(n-k), n>=1.
%F A166897 Logarithmic derivative of A166896.
%F A166897 a(n) ~ sqrt(15) * phi^(3*n + 2) / (6*Pi*n), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - _Vaclav Kotesovec_, Nov 27 2017
%e A166897 L.g.f.: L(x) = x + 3*x^2/2 + 13*x^3/3 + 39*x^4/4 + 126*x^5/5 + 477*x^6/6 +...
%e A166897 exp(L(x)) = 1 + x + 2*x^2 + 6*x^3 + 16*x^4 + 45*x^5 + 142*x^6 + 459*x^7 +...+ A166896(n)*x^n/n +...
%t A166897 Table[Sum[Binomial[n-k,k]^3 n/(n-k),{k,0,Floor[n/2]}],{n,30}] (* _Harvey P. Dale_, Mar 05 2013 *)
%o A166897 (PARI) a(n)=sum(k=0,n\2,binomial(n-k,k)^3*n/(n-k))
%Y A166897 Cf. A166897, variants: A167539, A166895, A166899.
%K A166897 nonn
%O A166897 1,2
%A A166897 _Paul D. Hanna_, Nov 23 2009