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 A277426 #20 Nov 16 2016 13:22:05
%S A277426 32,2048,131072,8388608,536870912,34359738368,2199023255552,
%T A277426 140737488355328,9007199254740992,576460752303423488,
%U A277426 36893488147419103232,2361183241434822606848,151115727451828646838272,9671406556917033397649408,618970019642690137449562112,39614081257132168796771975168
%N A277426 a(n) = 2^(6n+5).
%C A277426 Additive digital root of a(n) = 5.
%H A277426 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A277426 <a href="http://oeis.org/index/Di#divseq">Index to divisibility sequences</a>
%H A277426 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (64).
%F A277426 a(n) = 64*a(n-1).
%F A277426 G.f.: 32/(1-64*x). - _Vincenzo Librandi_, Oct 30 2016
%t A277426 CoefficientList[Series[32 / (1 - 64 x), {x, 0, 20}], x] (* _Vincenzo Librandi_, Oct 30 2016 *)
%K A277426 nonn
%O A277426 0,1
%A A277426 _Miquel Cerda_, Oct 28 2016