login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
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
STATUS
approved