|
%I #22 Sep 08 2022 08:44:38
%S 4,128,4096,131072,4194304,134217728,4294967296,137438953472,
%T 4398046511104,140737488355328,4503599627370496,144115188075855872,
%U 4611686018427387904,147573952589676412928,4722366482869645213696
%N a(n) = 2^(5*n + 2).
%H Vincenzo Librandi, <a href="/A013823/b013823.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 (32).
%F From _Philippe Deléham_, Nov 24 2008: (Start)
%F a(n) = 32*a(n-1); a(0)=4.
%F G.f.: 4/(1-32*x).
%F a(n) = 4*A009976(n). (End)
%o (Magma) [2^(5*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011
%o (Maxima) makelist(2^(5*n+2),n,0,20); /* _Martin Ettl_, Oct 21 2012 */
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
| 