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 A228462 #10 Sep 11 2018 05:51:47 %S A228462 17,91,310,821,1847,3703,6812,11721,19117,29843,44914,65533,93107, %T A228462 129263,175864,235025,309129,400843,513134,649285,812911,1007975, %U A228462 1238804,1510105,1826981,2194947,2619946,3108365,3667051,4303327,5025008,5840417 %N A228462 Number of arrays of maxima of three adjacent elements of some length 7 0..n array. %H A228462 R. H. Hardin, <a href="/A228462/b228462.txt">Table of n, a(n) for n = 1..210</a> %F A228462 Empirical: a(n) = (2/15)*n^5 + (7/6)*n^4 + (25/6)*n^3 + (19/3)*n^2 + (21/5)*n + 1. %F A228462 Conjectures from _Colin Barker_, Sep 11 2018: (Start) %F A228462 G.f.: x*(17 - 11*x + 19*x^2 - 14*x^3 + 6*x^4 - x^5) / (1 - x)^6. %F A228462 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6. %F A228462 (End) %e A228462 Some solutions for n=4: %e A228462 ..2....2....0....2....3....4....4....3....3....4....4....4....4....2....4....1 %e A228462 ..0....1....0....1....3....4....4....1....1....2....2....3....2....1....0....4 %e A228462 ..2....1....1....0....2....3....3....2....1....0....2....1....1....2....1....4 %e A228462 ..3....0....3....2....2....2....2....2....1....2....1....3....2....2....1....4 %e A228462 ..3....0....3....4....1....2....1....4....0....3....2....4....4....2....2....0 %Y A228462 Row 5 of A228461. %K A228462 nonn %O A228462 1,1 %A A228462 _R. H. Hardin_, Aug 22 2013