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!)
A036546 a(n) = T(5,n), array T given by A048471. 2
1, 33, 129, 417, 1281, 3873, 11649, 34977, 104961, 314913, 944769, 2834337, 8503041, 25509153, 76527489, 229582497, 688747521, 2066242593, 6198727809, 18596183457, 55788550401, 167365651233, 502096953729, 1506290861217 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 16*3^n - 15. - Ralf Stephan, Feb 17 2004
From Vincenzo Librandi, Nov 11 2011: (Start)
a(n) = 3*a(n-1) + 30.
a(n) = 4*a(n-1) - 3*a(n-2).
G.f.: (1+29*x)/((1-x)*(1-3*x)). (End)
MATHEMATICA
LinearRecurrence[{4, -3}, {1, 33}, 30] (* Harvey P. Dale, Mar 16 2012 *)
PROG
(Magma) [16*3^n-15: n in [0..30]]; // Vincenzo Librandi, Nov 11 2011
CROSSREFS
n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+4) for n=1, 2, 3, ...
Sequence in context: A007419 A158575 A209981 * A043502 A044365 A044746
KEYWORD
nonn,easy
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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)