login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066280 a(n) = 1^n + 2^(n+1) + 3^(n+2). 2
5, 12, 32, 90, 260, 762, 2252, 6690, 19940, 59562, 178172, 533490, 1598420, 4791162, 14365292, 43079490, 129205700, 387551562, 1162523612, 3487308690, 10461401780, 31383156762, 94147373132, 282437925090, 847305386660 (list; graph; refs; listen; history; text; internal format)
OFFSET

-1,1

LINKS

Harry J. Smith, Table of n, a(n) for n = -1..200

Index entries for linear recurrences with constant coefficients, signature (6, -11, 6).

FORMULA

a(n) = 1 + A000079(n+1) + A000244(n+2).

From R. J. Mathar, Feb 19 2010: (Start)

a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3).

G.f.: (-18*x+15*x^2+5)/((1-x) * (3*x-1) * (2*x-1) * x). (End)

MATHEMATICA

Table[ 1^(n + 1) + 2^(n + 2) + 3^(n + 3), {n, -2, 24} ]

PROG

(PARI) { for (n=-1, 200, write("b066280.txt", n, " ", 1^n + 2^(n + 1) + 3^(n + 2)) ) } \\ Harry J. Smith, Feb 08 2010

CROSSREFS

Sequence in context: A327323 A192303 A301785 * A333886 A192243 A292104

Adjacent sequences:  A066277 A066278 A066279 * A066281 A066282 A066283

KEYWORD

nonn

AUTHOR

George E. Antoniou, Dec 10 2001

EXTENSIONS

More terms from Robert G. Wilson v, Dec 11 2001

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 August 5 08:27 EDT 2021. Contains 346464 sequences. (Running on oeis4.)