cp's OEIS Frontend

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.

A200766 Number of 0..n arrays x(0..5) of 6 elements with nondecreasing average value.

This page as a plain text file.
%I A200766 #7 Jul 22 2025 15:55:04
%S A200766 7,53,233,767,2070,4874,10283,20012,36412,62780,103412,164018,251615,
%T A200766 375282,545834,776713,1083692,1485962,2005409,2668396,3504549,4548781,
%U A200766 5840076,7423854,9349952,11676207,14465536,17789881,21727318,26366500
%N A200766 Number of 0..n arrays x(0..5) of 6 elements with nondecreasing average value.
%C A200766 Row 6 of A200763
%H A200766 R. H. Hardin, <a href="/A200766/b200766.txt">Table of n, a(n) for n = 1..210</a>
%F A200766 Empirical: a(n) = a(n-1) +a(n-2) +a(n-3) -2*a(n-4) -3*a(n-5) +2*a(n-6) +2*a(n-7) +4*a(n-8) -5*a(n-9) -4*a(n-10) -a(n-11) +5*a(n-12) +7*a(n-13) -5*a(n-14) -3*a(n-15) -6*a(n-16) +6*a(n-17) +4*a(n-18) +a(n-19) -a(n-20) -7*a(n-21) +2*a(n-22) -2*a(n-23) +7*a(n-24) +a(n-25) -a(n-26) -4*a(n-27) -6*a(n-28) +6*a(n-29) +3*a(n-30) +5*a(n-31) -7*a(n-32) -5*a(n-33) +a(n-34) +4*a(n-35) +5*a(n-36) -4*a(n-37) -2*a(n-38) -2*a(n-39) +3*a(n-40) +2*a(n-41) -a(n-42) -a(n-43) -a(n-44) +a(n-45)
%e A200766 Some solutions for n=8
%e A200766 ..0....0....2....0....0....0....1....1....0....0....0....0....1....0....0....0
%e A200766 ..1....2....4....0....0....5....6....4....3....2....2....1....3....2....0....5
%e A200766 ..5....2....3....1....1....7....8....6....5....6....5....5....7....5....0....6
%e A200766 ..2....4....5....6....1....7....7....5....5....4....7....3....4....6....4....6
%e A200766 ..2....5....4....3....1....6....8....7....7....7....6....8....4....5....1....5
%e A200766 ..6....7....4....8....3....8....8....8....5....5....5....8....5....6....7....7
%K A200766 nonn
%O A200766 1,1
%A A200766 _R. H. Hardin_ Nov 22 2011