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!)
A058968 a(n) = 2^n + 2^(n - 1) - n - 8. 1

%I #14 Jul 02 2023 15:48:13

%S 1,12,35,82,177,368,751,1518,3053,6124,12267,24554,49129,98280,196583,

%T 393190,786405,1572836,3145699,6291426,12582881,25165792,50331615,

%U 100663262,201326557,402653148,805306331,1610612698,3221225433

%N a(n) = 2^n + 2^(n - 1) - n - 8.

%D B. Elspas, The theory of multirail cascades, in A. Mukhopadhyay, ed., Recent Developments in Switching Theory, Ac. Press, 1971, Chap. 8, see esp. p. 362 (YT(n)).

%H Harry J. Smith, <a href="/A058968/b058968.txt">Table of n, a(n) for n = 3..200</a>

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

%F G.f.: x^3*(1+8*x-8*x^2)/((1-x)^2*(1-2*x)). [_Colin Barker_, Apr 22 2012]

%o (PARI) { for (n = 3, 200, write("b058968.txt", n, " ", 2^n + 2^(n - 1) - n - 8); ) } \\ _Harry J. Smith_, Jun 24 2009

%K nonn,easy

%O 3,2

%A _N. J. A. Sloane_, Jan 14 2001

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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)