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 A095828 #12 Aug 05 2018 11:32:15 %S A095828 1,3,9,19,46,93,189,379,782,1565,3133,6267,12542,25085,50173,100347, %T A095828 200761,401523,803049,1606099,3212206,6424413,12848829,25697659, %U A095828 51395342,102790685,205581373,411162747,822325502,1644651005,3289302013,6578604027,13157208249 %N A095828 Smoothed lengths of the B blocks in analysis of A090822. %H A095828 F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Sloane/sloane55.html">A Slow-Growing Sequence Defined by an Unusual Recurrence</a>, J. Integer Sequences, Vol. 10 (2007), #07.1.2. %H A095828 F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [<a href="http://neilsloane.com/doc/gijs.pdf">pdf</a>, <a href="http://neilsloane.com/doc/gijs.ps">ps</a>]. %H A095828 <a href="/index/Ge#Gijswijt">Index entries for sequences related to Gijswijt's sequence</a> %F A095828 a(1) = 1; for n > 1, a(n+1) = 2*a(n) + A091839(n). %F A095828 This roughly doubles at each step and a(n) -> 1.5317006328915480... * 2^n. %Y A095828 Cf. A090822, A091839, A091411. %K A095828 nonn %O A095828 1,2 %A A095828 _N. J. A. Sloane_, Jul 10 2004