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 A215193 #6 Jul 22 2025 23:23:12 %S A215193 0,30,440,2898,11756,36864,95832,219092,452368,864810,1551080,2642774, %T A215193 4310012,6776612,10320160,15292160,22115896,31311374,43491392, %U A215193 59391706,79863756,105911744,138681424,179503444,229878952,291529666,366378408 %N A215193 Number of arrays of 6 0..n integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements. %C A215193 Row 6 of A215190 %H A215193 R. H. Hardin, <a href="/A215193/b215193.txt">Table of n, a(n) for n = 1..135</a> %F A215193 Empirical: a(n) = 2*a(n-1) +a(n-2) -2*a(n-3) -2*a(n-4) -2*a(n-5) +5*a(n-6) +2*a(n-7) -2*a(n-9) -5*a(n-10) +2*a(n-11) +2*a(n-12) +2*a(n-13) -a(n-14) -2*a(n-15) +a(n-16) %e A215193 Some solutions for n=6 %e A215193 ..4....4....4....4....1....6....6....4....1....4....6....6....0....1....1....0 %e A215193 ..3....0....5....3....4....0....0....2....4....5....5....3....2....0....0....3 %e A215193 ..2....6....2....2....5....1....3....1....3....1....1....6....5....6....1....0 %e A215193 ..3....1....4....4....1....3....6....3....5....5....2....4....6....0....5....4 %e A215193 ..6....3....0....0....3....2....1....4....3....0....3....1....5....5....6....5 %e A215193 ..4....5....4....3....2....0....4....2....4....3....2....5....2....3....3....4 %K A215193 nonn %O A215193 1,2 %A A215193 _R. H. Hardin_ Aug 05 2012