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 A244791 #5 Nov 16 2016 12:37:14 %S A244791 4,7,20,51,88,135,166,243,382,509,512,741,936,1261,1532,1543,2000, %T A244791 2367,2956,3425,3448,4211,4804,5735,6456,6815,7642,8515,9866,9913, %U A244791 11408,12561,13768,15617,15686,17703,19236,20831,23256,23351,25968,27935,29972,30963 %N A244791 Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean. %C A244791 Row 3 of A244788 %H A244791 R. H. Hardin, <a href="/A244791/b244791.txt">Table of n, a(n) for n = 1..210</a> %e A244791 Some solutions for n=10 %e A244791 ..4....2....5....7....6....5....3....6....5....3....7....8....3....4....4....7 %e A244791 ..5...10....5....3....4....8....5....0....2....4....5....2....6...10....4....2 %e A244791 ..3....1....9....1....3....1....7....7...10....8....2....0....4....3....7....4 %K A244791 nonn %O A244791 1,1 %A A244791 _R. H. Hardin_, Jul 06 2014