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!)
A054135 a(n) = T(n,1), array T as in A054134. 2

%I #20 Jun 12 2022 06:44:30

%S 2,4,9,19,39,79,159,319,639,1279,2559,5119,10239,20479,40959,81919,

%T 163839,327679,655359,1310719,2621439,5242879,10485759,20971519,

%U 41943039,83886079,167772159,335544319,671088639,1342177279

%N a(n) = T(n,1), array T as in A054134.

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

%F For n > 2, a(n) = 10*A000225(n-3) + 9 = 10*(2^(n-3) - 1) + 9 = 10*2^(n-3) - 1. - _Gerald McGarvey_, Aug 25 2004

%F a(1)=1, a(n) = n + Sum_{i=1..n-1} a(i) for n > 1. - _Gerald McGarvey_, Sep 06 2004

%F a(n) = 5*2^(n-2) - 1 for n > 1. - _Karl V. Keller, Jr._, Jun 12 2022

%o (Python) print([2]+[(5*2**(n-2) - 1) for n in range(2, 50)]) # _Karl V. Keller, Jr._, Jun 12 2022

%Y Identical to A052549 except for initial term.

%Y Cf. A267524.

%K nonn

%O 1,1

%A _Clark Kimberling_

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