login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074614 a(n) = 4^n + 9^n. 1
2, 13, 97, 793, 6817, 60073, 535537, 4799353, 43112257, 387682633, 3487832977, 31385253913, 282446313697, 2541932937193, 22877060890417, 205892205836473, 1853024483819137, 16677198879535753, 150094704016475857 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..18.

Index entries for linear recurrences with constant coefficients, signature (13,-36).

FORMULA

a(n) = 2^(2*n) + 3^(2*n).

G.f.: (2-13*x)/((1-4*x)*(1-9*x)).

E.g.f.: e^(4*x) + e^(10*x). - Mohammad K. Azarian, Jan 11 2009

a(n) = 13*a(n-1) - 36*a(n-2) with a(0)=2, a(1)=13. - Vincenzo Librandi, Jul 21 2010

MATHEMATICA

Table[4^n + 9^n, {n, 0, 25}]

LinearRecurrence[{13, -36}, {2, 13}, 30] (* Harvey P. Dale, Aug 11 2017 *)

PROG

(PARI) a(n)=4^n+9^n \\ Charles R Greathouse IV, Jul 01 2016

CROSSREFS

Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A063376, A063481, A074600..A074624.

Bisection of A007689 (even indexed members). For odd indexed members divided by 5 see A096951.

Sequence in context: A104255 A118352 A320360 * A184019 A300633 A064325

Adjacent sequences:  A074611 A074612 A074613 * A074615 A074616 A074617

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Aug 26 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 15:02 EDT 2019. Contains 328030 sequences. (Running on oeis4.)