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!)
A199032 a(n) = 3*12^n-1. 1

%I #20 Mar 20 2023 05:07:16

%S 2,35,431,5183,62207,746495,8957951,107495423,1289945087,15479341055,

%T 185752092671,2229025112063,26748301344767,320979616137215,

%U 3851755393646591,46221064723759103,554652776685109247,6655833320221310975

%N a(n) = 3*12^n-1.

%H Vincenzo Librandi, <a href="/A199032/b199032.txt">Table of n, a(n) for n = 0..900</a>

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

%F a(n) = 12*a(n-1)+11.

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

%F G.f.: (2+9*x)/((1-x)*(1-12*x)). - _Bruno Berselli_, Nov 03 2011

%t 3*12^Range[0,30]-1 (* or *) LinearRecurrence[{13,-12},{2,35},30] (* _Harvey P. Dale_, Apr 20 2015 *)

%o (Magma) [3*12^n-1 : n in [0..20]]

%K nonn,easy

%O 0,1

%A _Vincenzo Librandi_, Nov 03 2011

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)