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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013779 a(n) = 3^(4*n + 3). 1

%I

%S 27,2187,177147,14348907,1162261467,94143178827,7625597484987,

%T 617673396283947,50031545098999707,4052555153018976267,

%U 328256967394537077627,26588814358957503287787,2153693963075557766310747

%N a(n) = 3^(4*n + 3).

%H Vincenzo Librandi, <a href="/A013779/b013779.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 (81).

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

%F a(n) = 81*a(n-1); a(0)=27.

%F G.f.: 27/(1-81*x). (End)

%o (MAGMA) [3^(4*n+3): n in [0..20]]; // _Vincenzo Librandi_, Jun 27 2011

%Y Subsequence of A000244.

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 16 19:29 EST 2019. Contains 320167 sequences. (Running on oeis4.)