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.

A245137 Number of length 7 0..n arrays least squares fitting to a zero slope straight line, with a single point taken as having zero slope.

This page as a plain text file.
%I A245137 #6 Jul 23 2025 11:29:15
%S A245137 20,195,1064,4005,11856,29813,66256,134091,252060,446193,751536,
%T A245137 1214369,1893612,2863755,4217056,6065957,8545968,11819349,16076760,
%U A245137 21542115,28475524,37176625,47988672,61303825,77564708,97271523,120985592
%N A245137 Number of length 7 0..n arrays least squares fitting to a zero slope straight line, with a single point taken as having zero slope.
%C A245137 Row 7 of A245134
%H A245137 R. H. Hardin, <a href="/A245137/b245137.txt">Table of n, a(n) for n = 1..210</a>
%F A245137 Empirical: a(n) = a(n-1) +3*a(n-2) -6*a(n-4) -6*a(n-5) +7*a(n-6) +11*a(n-7) -11*a(n-9) -7*a(n-10) +6*a(n-11) +6*a(n-12) -3*a(n-14) -a(n-15) +a(n-16)
%e A245137 Some solutions for n=8
%e A245137 ..4....6....4....0....5....5....4....1....6....5....6....5....3....5....1....3
%e A245137 ..2....1....5....7....3....8....3....2....0....1....2....6....7....4....7....7
%e A245137 ..1....8....1....6....8....8....7....3....2....6....2....7....0....7....4....1
%e A245137 ..6....0....0....3....0....7....5....1....2....7....2....8....1....1....6....1
%e A245137 ..5....2....5....2....7....5....0....5....1....7....7....6....8....5....2....6
%e A245137 ..0....7....0....6....2....8....2....1....8....5....7....2....0....2....2....0
%e A245137 ..4....4....6....2....6....6....7....1....1....2....1....8....5....7....5....6
%K A245137 nonn
%O A245137 1,1
%A A245137 _R. H. Hardin_, Jul 12 2014