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 A245135 #9 Jul 23 2025 11:29:00 %S A245135 8,39,112,275,552,1029,1728,2781,4200,6171,8688,11999,16072,21225, %T A245135 27392,34969,43848,54511,66800,81291,97768,116909,138432,163125, %U A245135 190632,221859,256368,295191,337800,385361,437248,494769,557192,625975,700272,781699 %N A245135 Number of length 5 0..n arrays least squares fitting to a zero slope straight line, with a single point taken as having zero slope. %C A245135 Row 5 of A245134 %H A245135 R. H. Hardin, <a href="/A245135/b245135.txt">Table of n, a(n) for n = 1..210</a> %F A245135 Empirical: a(n) = 2*a(n-1) +2*a(n-2) -6*a(n-3) +6*a(n-5) -2*a(n-6) -2*a(n-7) +a(n-8). %F A245135 Empirical: G.f.: -x*(8+23*x+18*x^2+21*x^3+12*x^4-x^5-2*x^6+x^7) / ( (1+x)^3*(x-1)^5 ). - _R. J. Mathar_, Jul 12 2014 %e A245135 Some solutions for n=10 %e A245135 ..8....8....5....6....6....7....5....1....9....5....7....4....4....0....7....4 %e A245135 ..0....0....6....3....5....6....6....6....0....2....1....7...10....6....1....8 %e A245135 ..3....6....2....7....3....4....6....6...10....2....7....9....0....0....4....0 %e A245135 ..6....0...10....1....9....6....4....8....0...10....3....7....2....0....3....0 %e A245135 ..5....8....3....7....4....7....6....0....9....1....6....4....8....3....6....8 %K A245135 nonn %O A245135 1,1 %A A245135 _R. H. Hardin_, Jul 12 2014