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!)
A013727 a(n) = 22^(2*n + 1). 3

%I #21 Sep 08 2022 08:44:38

%S 22,10648,5153632,2494357888,1207269217792,584318301411328,

%T 282810057883082752,136880068015412051968,66249952919459433152512,

%U 32064977213018365645815808,15519448971100888972574851072

%N a(n) = 22^(2*n + 1).

%H Vincenzo Librandi, <a href="/A013727/b013727.txt">Table of n, a(n) for n = 0..200</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (484).

%F From _Philippe Deléham_, Nov 28 2008: (Start)

%F a(n) = 484*a(n-1); a(0)=22.

%F G.f.: 22/(1-484*x). (End)

%p seq(22^(2*n+1),n=0..10); # _Nathaniel Johnston_, Jun 26 2011

%o (Magma) [22^(2*n+1): n in [0..15]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=22^(2*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Cf. A013708-A013726, A013728-A013729.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)