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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063270 a(n) = 9^(2n) + 1. 2
2, 82, 6562, 531442, 43046722, 3486784402, 282429536482, 22876792454962, 1853020188851842, 150094635296999122, 12157665459056928802, 984770902183611232882, 79766443076872509863362, 6461081889226673298932242, 523347633027360537213511522 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..100

Index entries for linear recurrences with constant coefficients, signature (82, -81).

FORMULA

a(n) = 82*a(n-1) - 81*a(n-2), a(0)=2, a(1)=82. - Harvey P. Dale, Jul 31 2013

MATHEMATICA

9^(2*Range[0, 20])+1 (* or *) LinearRecurrence[{82, -81}, {2, 82}, 20] (* Harvey P. Dale, Jul 31 2013 *)

PROG

(PARI) a(n) = 9^(2*n) + 1;

CROSSREFS

Cf. A063271.

Sequence in context: A197641 A093666 A246002 * A087617 A263365 A140157

Adjacent sequences:  A063267 A063268 A063269 * A063271 A063272 A063273

KEYWORD

easy,nonn

AUTHOR

Jason Earls, Jul 12 2001

EXTENSIONS

More terms from Harvey P. Dale, Jul 31 2013

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 December 6 08:47 EST 2021. Contains 349563 sequences. (Running on oeis4.)