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

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

%S 8,4096,2097152,1073741824,549755813888,281474976710656,

%T 144115188075855872,73786976294838206464,37778931862957161709568,

%U 19342813113834066795298816,9903520314283042199192993792,5070602400912917605986812821504

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

%H Vincenzo Librandi, <a href="/A013742/b013742.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 (512).

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

%F a(n) = 512*a(n-1); a(0)=8.

%F G.f.: 8/(1-512*x). (End)

%p seq(8^(3*n+1),n=0..11); # _Nathaniel Johnston_, Jun 26 2011

%o (Magma) [8^(3*n+1): n in [0..20]]; // _Vincenzo Librandi_, Jun 26 2011

%o (PARI) a(n)=8^(3*n+1) \\ _Charles R Greathouse IV_, Jul 11 2016

%Y Cf. A013743.

%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 March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)