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

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

%S 4096,4294967296,4503599627370496,4722366482869645213696,

%T 4951760157141521099596496896,5192296858534827628530496329220096,

%U 5444517870735015415413993718908291383296,5708990770823839524233143877797980545530986496

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

%H Vincenzo Librandi, <a href="/A013880/b013880.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 (1048576).

%o (Magma) [16^(5*n+3): n in [0..10]]; // _Vincenzo Librandi_, Jul 10 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 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)