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 A228460 #6 Jul 23 2025 05:39:52 %S A228460 8,64,372,1716,6812,25096,92430,357510,1453506,6026658,24812574, %T A228460 100499726,402014614,1601790692,6399288759,25687363699,103446743321, %U A228460 416881245069,1678284756985,6747301104293,27104825271091,108875206199331 %N A228460 Number of arrays of maxima of three adjacent elements of some length n+2 0..7 array. %C A228460 Column 7 of A228461 %H A228460 R. H. Hardin, <a href="/A228460/b228460.txt">Table of n, a(n) for n = 1..144</a> %F A228460 Empirical: a(n) = 8*a(n-1) -28*a(n-2) +56*a(n-3) -42*a(n-4) +168*a(n-6) -48*a(n-7) +195*a(n-8) +340*a(n-9) +154*a(n-10) +408*a(n-11) +432*a(n-12) +276*a(n-13) +338*a(n-14) +268*a(n-15) +149*a(n-16) +118*a(n-17) +71*a(n-18) +28*a(n-19) +14*a(n-20) +6*a(n-21) +a(n-22) %e A228460 Some solutions for n=4 %e A228460 ..5....7....3....0....7....6....7....2....7....5....2....4....3....4....7....5 %e A228460 ..1....1....2....1....6....1....4....1....3....4....2....2....6....0....1....5 %e A228460 ..0....0....1....5....2....2....2....1....6....1....0....2....7....0....2....0 %e A228460 ..1....4....2....5....7....6....5....6....6....0....6....6....7....6....5....5 %K A228460 nonn %O A228460 1,1 %A A228460 _R. H. Hardin_ Aug 22 2013