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!)
A199317 a(n) = 2*6^n + 1. 1

%I #20 Feb 27 2024 13:34:46

%S 3,13,73,433,2593,15553,93313,559873,3359233,20155393,120932353,

%T 725594113,4353564673,26121388033,156728328193,940369969153,

%U 5642219814913,33853318889473,203119913336833,1218719480020993,7312316880125953,43873901280755713

%N a(n) = 2*6^n + 1.

%H Vincenzo Librandi, <a href="/A199317/b199317.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = 6*a(n-1)-5.

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

%F G.f.: (3-8*x)/((1-x)*(1-6*x)).

%F a(n) = 1 + A167747(n+1) = 1 + 2*A000400(n) = A000400(n) + A062394(n). - _Alois P. Heinz_, Jul 02 2023

%t 2 6^Range[0,30]+1 (* or *) LinearRecurrence[{7,-6},{3,13},30] (* _Harvey P. Dale_, Jul 02 2023 *)

%o (Magma) [2*6^n+1: n in [0..30]];

%Y Cf. A000400, A062394, A167747.

%K nonn,easy

%O 0,1

%A _Vincenzo Librandi_, Nov 05 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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)