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 A200254 #7 Jun 02 2025 07:17:59 %S A200254 13,48,181,405,951,1792,3434,5625,9365,14256,21855,31213,44863,61440, %T A200254 84500,111537,147789,190000,244905,307461,386903,476928,588990,714025, %U A200254 867061,1037232,1242451,1468125,1736895,2031616,2378792,2756193,3196493 %N A200254 Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its previous elements modulo (n+1). %C A200254 Row 5 of A200251 %H A200254 R. H. Hardin, <a href="/A200254/b200254.txt">Table of n, a(n) for n = 1..210</a> %F A200254 Empirical: a(n) = 2*a(n-1) -2*a(n-3) +2*a(n-4) -2*a(n-5) +2*a(n-7) +a(n-8) -4*a(n-9) +4*a(n-11) -4*a(n-12) +4*a(n-13) -4*a(n-15) +a(n-16) +2*a(n-17) -2*a(n-19) +2*a(n-20) -2*a(n-21) +2*a(n-23) -a(n-24) %e A200254 Some solutions for n=6 %e A200254 ..4....5....5....1....4....1....0....0....6....2....3....1....1....4....0....2 %e A200254 ..6....6....5....1....6....3....5....1....6....2....6....2....1....6....5....4 %e A200254 ..4....6....6....2....4....6....5....2....6....5....3....6....5....4....5....6 %e A200254 ..1....6....5....4....1....3....4....4....6....3....6....6....0....1....6....5 %e A200254 ..5....3....3....3....1....6....5....1....4....5....5....5....6....6....4....4 %K A200254 nonn %O A200254 1,1 %A A200254 _R. H. Hardin_ Nov 15 2011