login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219205 a(n) = 3^(n-1)*(3^n - 1), n >= 0. 1

%I #26 Feb 14 2024 10:46:40

%S 0,2,24,234,2160,19602,176904,1593594,14346720,129133602,1162241784,

%T 10460294154,94143001680,847288078002,7625595890664,68630372581914,

%U 617673381935040,5559060523508802,50031544969859544,450283905503576874

%N a(n) = 3^(n-1)*(3^n - 1), n >= 0.

%C Last digit has period 4: 0, 2, 4, 4.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-27).

%F a(n) = 2 * A016142(n-1).

%F a(n) = 12*a(n-1)-27*a(n-2). G.f.: 2*x/((3*x-1)*(9*x-1)). [_Colin Barker_, Nov 23 2012]

%t LinearRecurrence[{12, -27}, {0, 2}, 20] (* _Hugo Pfoertner_, Feb 14 2024 *)

%o (JavaScript)

%o for (j=0;j<20;j++) document.write((Math.pow(3,j)-1)*Math.pow(3,j-1)+", ");

%o (Maxima) A219205(n):=3^(n-1)*(3^n - 1)$ makelist(A219205(n),n,0,30); /* _Martin Ettl_, Nov 15 2012 */

%Y Cf. A006516, A016142.

%K nonn,easy

%O 0,2

%A _Jon Perry_, Nov 14 2012

%E a(19) corrected by _Colin Barker_, Nov 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 13:41 EDT 2024. Contains 371254 sequences. (Running on oeis4.)