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
2, 4, 9, 19, 39, 79, 159, 319, 639, 1279, 2559, 5119, 10239, 20479, 40959, 81919, 163839, 327679, 655359, 1310719, 2621439, 5242879, 10485759, 20971519, 41943039, 83886079, 167772159, 335544319, 671088639, 1342177279 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
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
a(1)=1, a(n) = n + Sum_{i=1..n-1} a(i) for n > 1. - Gerald McGarvey, Sep 06 2004
a(n) = 5*2^(n-2) - 1 for n > 1. - Karl V. Keller, Jr., Jun 12 2022
PROG
(Python) print([2]+[(5*2**(n-2) - 1) for n in range(2, 50)]) # Karl V. Keller, Jr., Jun 12 2022
CROSSREFS
Identical to A052549 except for initial term.
Cf. A267524.
Sequence in context: A265387 A293322 A267157 * A171858 A099568 A018001
KEYWORD
nonn
AUTHOR
STATUS
approved

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 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)