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 A013833 #25 Jun 06 2025 15:06:43 %S A013833 256,262144,268435456,274877906944,281474976710656,288230376151711744, %T A013833 295147905179352825856,302231454903657293676544, %U A013833 309485009821345068724781056,316912650057057350374175801344,324518553658426726783156020576256 %N A013833 a(n) = 4^(5*n + 4). %H A013833 Vincenzo Librandi, <a href="/A013833/b013833.txt">Table of n, a(n) for n = 0..100</a> %H A013833 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A013833 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1024). %F A013833 From _Philippe Deléham_, Nov 30 2008: (Start) %F A013833 a(n) = 1024*a(n-1), n > 0; a(0)=256. %F A013833 G.f.: 256/(1-1024*x). %F A013833 a(n) = 4*A013832(n). (End) %t A013833 4^(5*Range[0, 10] + 4) (* _Paul F. Marrero Romero_, Sep 30 2024 *) %t A013833 NestList[1024#&,256,20] (* _Harvey P. Dale_, Jun 06 2025 *) %o A013833 (Magma) [4^(5*n+4): n in [0..15]]; // _Vincenzo Librandi_, Jul 07 2011 %Y A013833 Cf. A000302 (4^n), A016897 (5*n+4). %K A013833 nonn,easy %O A013833 0,1 %A A013833 _N. J. A. Sloane_