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

%I #19 Mar 20 2023 05:07:02

%S 1,23,287,3455,41471,497663,5971967,71663615,859963391,10319560703,

%T 123834728447,1486016741375,17832200896511,213986410758143,

%U 2567836929097727,30814043149172735,369768517790072831,4437222213480873983

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

%H Vincenzo Librandi, <a href="/A199031/b199031.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.: (1+10*x)/((1-x)*(1-12*x)). - _Bruno Berselli_, Nov 03 2011

%t LinearRecurrence[{13,-12},{1,23},40] (* _Harvey P. Dale_, Feb 21 2013 *)

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

%K nonn,easy

%O 0,2

%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 26 21:53 EDT 2024. Contains 372004 sequences. (Running on oeis4.)