login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = 2^(5*n + 1).
3

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

%S 2,64,2048,65536,2097152,67108864,2147483648,68719476736,

%T 2199023255552,70368744177664,2251799813685248,72057594037927936,

%U 2305843009213693952,73786976294838206464,2361183241434822606848

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

%H Vincenzo Librandi, <a href="/A013822/b013822.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 (32).

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

%F a(n) = 32*a(n-1), n > 0; a(0)=2.

%F G.f.: 2/(1-32*x).

%F a(n) = 2*A009976(n). (End)

%t 2^(5*Range[0,20]+1) (* or *) NestList[32#&,2,20] (* _Harvey P. Dale_, Aug 20 2020 *)

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

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

%Y Cf. A000079 (2^n), A016861 (5*n+1).

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_