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 A241611 #6 Jun 02 2025 10:10:19 %S A241611 56,196,686,2254,7586,25774,86828,292621,988303,3335451,11253229, %T A241611 37977866,128168421,432512171,1459576829,4925618766,16622258696, %U A241611 56094381015,189299674740,638822175369,2155807165360,7275117316894 %N A241611 Number of length n+2 0..5 arrays with no consecutive three elements summing to more than 5. %C A241611 Column 5 of A241619 %H A241611 R. H. Hardin, <a href="/A241611/b241611.txt">Table of n, a(n) for n = 1..210</a> %F A241611 Empirical: a(n) = 2*a(n-1) +2*a(n-2) +12*a(n-3) -4*a(n-4) -12*a(n-5) -36*a(n-6) +2*a(n-7) +16*a(n-8) +47*a(n-9) -4*a(n-10) -16*a(n-11) -33*a(n-12) +4*a(n-13) +10*a(n-14) +16*a(n-15) -a(n-16) -3*a(n-17) -4*a(n-18) +a(n-20) +a(n-21) %e A241611 Some solutions for n=5 %e A241611 ..2....1....3....0....0....2....1....0....1....0....2....4....0....1....1....2 %e A241611 ..0....0....1....0....0....2....2....4....1....0....3....1....0....1....3....2 %e A241611 ..1....4....0....1....1....1....2....0....1....3....0....0....0....2....0....1 %e A241611 ..0....0....1....2....4....0....1....0....3....1....0....0....0....1....0....2 %e A241611 ..0....0....0....2....0....1....2....3....0....0....5....1....0....0....2....1 %e A241611 ..0....3....3....1....0....3....0....1....2....2....0....3....0....2....0....2 %e A241611 ..2....0....1....2....1....0....1....1....3....2....0....0....4....3....3....2 %K A241611 nonn %O A241611 1,1 %A A241611 _R. H. Hardin_, Apr 26 2014