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.

A242148 Number of length 4+5 0..n arrays with no consecutive six elements summing to more than 3*n.

This page as a plain text file.
%I A242148 #6 Jul 23 2025 11:15:35
%S A242148 236,7596,93308,663395,3319500,13006484,42564898,121330981,310054250,
%T A242148 725133024,1576001362,3220436895,6243597894,11567739640,20600804748,
%U A242148 35433429545,59095358912,95883815172,151778022640,234955848347
%N A242148 Number of length 4+5 0..n arrays with no consecutive six elements summing to more than 3*n.
%C A242148 Row 4 of A242144
%H A242148 R. H. Hardin, <a href="/A242148/b242148.txt">Table of n, a(n) for n = 1..210</a>
%F A242148 Empirical: a(n) = (51431/181440)*n^9 + (7069/2520)*n^8 + (373229/30240)*n^7 + (763/24)*n^6 + (457907/8640)*n^5 + (1191/20)*n^4 + (2059039/45360)*n^3 + (5759/252)*n^2 + (4399/630)*n + 1
%e A242148 Some solutions for n=3
%e A242148 ..0....2....0....0....2....2....3....2....2....3....3....2....2....3....1....2
%e A242148 ..2....2....3....2....0....0....1....0....1....0....0....2....0....2....1....1
%e A242148 ..1....0....0....0....0....0....3....1....2....0....1....3....2....0....0....0
%e A242148 ..3....0....2....0....1....2....0....0....3....2....0....0....1....2....3....0
%e A242148 ..0....1....0....1....3....0....0....1....0....2....2....1....0....2....3....1
%e A242148 ..2....2....3....0....0....2....0....1....0....2....3....1....0....0....0....2
%e A242148 ..1....1....1....3....3....1....3....2....1....2....1....0....0....2....1....0
%e A242148 ..0....1....1....0....1....2....2....1....2....1....1....1....0....2....2....0
%e A242148 ..0....2....1....2....0....1....0....0....2....0....0....3....2....1....0....2
%K A242148 nonn
%O A242148 1,1
%A A242148 _R. H. Hardin_, May 05 2014