This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A013823 #34 Feb 21 2025 09:29:13 %S A013823 4,128,4096,131072,4194304,134217728,4294967296,137438953472, %T A013823 4398046511104,140737488355328,4503599627370496,144115188075855872, %U A013823 4611686018427387904,147573952589676412928,4722366482869645213696,151115727451828646838272,4835703278458516698824704 %N A013823 a(n) = 2^(5*n + 2). %H A013823 Vincenzo Librandi, <a href="/A013823/b013823.txt">Table of n, a(n) for n = 0..200</a> %H A013823 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A013823 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (32). %F A013823 From _Philippe Deléham_, Nov 24 2008: (Start) %F A013823 a(n) = 32*a(n-1); a(0)=4. %F A013823 G.f.: 4/(1-32*x). %F A013823 a(n) = 4*A009976(n). (End) %F A013823 From _Elmo R. Oliveira_, Feb 20 2025: (Start) %F A013823 E.g.f.: 4*exp(32*x). %F A013823 a(n) = A000079(A016873(n)). (End) %F A013823 a(n) = 2*A013822(n) = A013824(n)/2. - _Paolo Xausa_, Feb 21 2025 %t A013823 2^(5*Range[0, 20] + 2) (* _Paolo Xausa_, Feb 21 2025 *) %o A013823 (Magma) [2^(5*n+2): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011 %o A013823 (Maxima) makelist(2^(5*n+2),n,0,20); /* _Martin Ettl_, Oct 21 2012 */ %Y A013823 Cf. A000079, A009976, A013822, A013824, A016873. %K A013823 nonn,easy %O A013823 0,1 %A A013823 _N. J. A. Sloane_