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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013847 a(n) = 8^(5*n + 2). 1

%I

%S 64,2097152,68719476736,2251799813685248,73786976294838206464,

%T 2417851639229258349412352,79228162514264337593543950336,

%U 2596148429267413814265248164610048,85070591730234615865843651857942052864

%N a(n) = 8^(5*n + 2).

%H Vincenzo Librandi, <a href="/A013847/b013847.txt">Table of n, a(n) for n = 0..100</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 (32768).

%t 8^(5 Range[0, 10] + 2) (* _Wesley Ivan Hurt_, Jan 15 2017 *)

%o (MAGMA) [8^(5*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jul 08 2011

%o (Maxima) makelist(8^(5*n+2),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

%Y Subsequence of A001018.

%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 November 22 10:59 EST 2019. Contains 329389 sequences. (Running on oeis4.)