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

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

%S 4096,268435456,17592186044416,1152921504606846976,

%T 75557863725914323419136,4951760157141521099596496896,

%U 324518553658426726783156020576256,21267647932558653966460912964485513216,1393796574908163946345982392040522594123776

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

%H Vincenzo Librandi, <a href="/A013805/b013805.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 (65536).

%t 16^(4Range[0,10]+3) (* _Harvey P. Dale_, Mar 05 2011 *)

%o (Magma) [16^(4*n+3): n in [0..15]]; // _Vincenzo Librandi_, Jul 06 2011

%o (Maxima) makelist(16^(4*n+3),n,0,20); /* _Martin Ettl_, Oct 21 2012 */

%o (PARI) a(n) = 16^(4*n+3); \\ _Altug Alkan_, Sep 08 2018

%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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)