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!)
A013846 a(n) = 8^(5*n + 1). 1

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

%S 8,262144,8589934592,281474976710656,9223372036854775808,

%T 302231454903657293676544,9903520314283042199192993792,

%U 324518553658426726783156020576256,10633823966279326983230456482242756608

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

%H Vincenzo Librandi, <a href="/A013846/b013846.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 NestList[32768#&,8,10] (* _Harvey P. Dale_, Jul 30 2018 *)

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

%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 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)