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.

A081139 9th binomial transform of (0,0,1,0,0,0,...).

This page as a plain text file.
%I A081139 #36 Sep 08 2022 08:45:09
%S A081139 0,0,1,27,486,7290,98415,1240029,14880348,172186884,1937102445,
%T A081139 21308126895,230127770466,2447722649502,25701087819771,
%U A081139 266895911974545,2745215094595320,28001193964872264,283512088894331673
%N A081139 9th binomial transform of (0,0,1,0,0,0,...).
%C A081139 Starting at 1, the three-fold convolution of A001019 (powers of 9).
%H A081139 Vincenzo Librandi, <a href="/A081139/b081139.txt">Table of n, a(n) for n = 0..400</a>
%H A081139 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (27,-243,729).
%F A081139 a(n) = 27*a(n-1) - 243*a(n-2) + 729*a(n-3), a(0)=a(1)=0, a(2)=1.
%F A081139 a(n) = 9^(n-2)*binomial(n, 2).
%F A081139 G.f.: x^2/(1-9*x)^3.
%F A081139 E.g.f.: (x^2/2)*exp(9*x). - _G. C. Greubel_, May 13 2021
%F A081139 From _Amiram Eldar_, Jan 06 2022: (Start)
%F A081139 Sum_{n>=2} 1/a(n) = 18 - 144*log(9/8).
%F A081139 Sum_{n>=2} (-1)^n/a(n) = 180*log(10/9) - 18. (End)
%t A081139 LinearRecurrence[{27,-243,729},{0,0,1},30] (* _Harvey P. Dale_, Jan 30 2018 *)
%o A081139 (Magma) [9^n* Binomial(n+2, 2): n in [-2..20]]; // _Vincenzo Librandi_, Oct 16 2011
%Y A081139 Sequences similar to the form q^(n-2)*binomial(n, 2): A000217 (q=1), A001788 (q=2), A027472 (q=3), A038845 (q=4), A081135 (q=5), A081136 (q=6), A027474 (q=7), A081138 (q=8), this sequence (q=9), A081140 (q=10), A081141 (q=11), A081142 (q=12), A027476 (q=15).
%Y A081139 Cf. A001019.
%K A081139 easy,nonn
%O A081139 0,4
%A A081139 _Paul Barry_, Mar 08 2003