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

%I #35 Oct 08 2022 08:33:47

%S 12,23,45,89,177,353,705,1409,2817,5633,11265,22529,45057,90113,

%T 180225,360449,720897,1441793,2883585,5767169,11534337,23068673,

%U 46137345,92274689,184549377,369098753,738197505,1476395009,2952790017,5905580033,11811160065

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

%C An Engel expansion of 2/11 to the base 2 as defined in A181565, with the associated series expansion 2/11 = 2/12 + 2^2/(12*23) + 2^3/(12*23*45) + 2^4/(12*23*45*89) + ... . - _Peter Bala_, Oct 29 2013

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

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

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

%F a(n) = 3*a(n-1) - 2*a(n-2), n>1. - _Vincenzo Librandi_, Nov 03 2011

%F G.f. (12-13*x)/((2*x-1)*(x-1)). - _R. J. Mathar_, Nov 03 2011

%F E.g.f.: exp(x)*(1 + 11*exp(x)). - _Stefano Spezia_, Oct 08 2022

%t 11*2^Range[0,30]+1 (* or *) LinearRecurrence[{3,-2},{12,23},40] (* _Harvey P. Dale_, Aug 17 2017 *)

%o (Magma) [11*2^n+1 : n in [0..30]]; // _Vincenzo Librandi_, Nov 03 2011

%o (PARI) a(n)=11*2^n+1 \\ _Charles R Greathouse IV_, Jun 11 2015

%Y Cf. A020737, A083575, A083686, A083705, A168596, A181565, A195744.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Jun 15 2003

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 29 09:28 EDT 2024. Contains 371268 sequences. (Running on oeis4.)