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 A200084 #9 Jul 23 2025 23:30:15 %S A200084 2,7,14,27,58,111,182,279,404,617,872,1199,1580,2045,2678,3437,4300, %T A200084 5305,6430,7903,9530,11389,13420,15707,18460,21537,24870,28553,32518, %U A200084 37265,42342,47905,53828,60267,67620,75589,84034,93127,102734,113729,125300 %N A200084 Number of 0..n arrays x(0..5) of 6 elements with zero 4th differences. %C A200084 Row 5 of A200082. %H A200084 R. H. Hardin, <a href="/A200084/b200084.txt">Table of n, a(n) for n = 1..200</a> %F A200084 Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +2*a(n-10) -2*a(n-11) -2*a(n-12) +2*a(n-13) +a(n-15) -a(n-16) -a(n-17) +a(n-18) -a(n-20) +a(n-21) +a(n-22) -a(n-23) -2*a(n-25) +2*a(n-26) +2*a(n-27) -2*a(n-28) +a(n-35) -a(n-36) -a(n-37) +a(n-38). %e A200084 Some solutions for n=6 %e A200084 ..0....5....6....5....1....4....6....5....4....0....4....4....4....6....5....0 %e A200084 ..6....3....5....5....1....4....6....3....4....4....6....2....0....3....1....3 %e A200084 ..6....3....5....3....1....5....6....1....2....6....4....2....1....2....0....5 %e A200084 ..3....4....5....1....1....6....6....0....0....6....1....3....4....2....1....6 %e A200084 ..0....5....4....1....1....6....6....1....0....4....0....4....6....2....3....6 %e A200084 ..0....5....1....5....1....4....6....5....4....0....4....4....4....1....5....5 %Y A200084 Cf. A200082. %K A200084 nonn %O A200084 1,1 %A A200084 _R. H. Hardin_, Nov 13 2011