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.

A224151 Number of 7Xn 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.

This page as a plain text file.
%I A224151 #6 Jul 23 2025 05:00:51
%S A224151 8,64,357,1536,5471,16885,46586,117510,275557,608423,1277544,2571226,
%T A224151 4991541,9394324,17211567,30799955,53979914,92858530,157069847,
%U A224151 261620888,429605663,696147855,1114062432,1761895136,2755216271,4262322913
%N A224151 Number of 7Xn 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.
%C A224151 Row 7 of A224146
%H A224151 R. H. Hardin, <a href="/A224151/b224151.txt">Table of n, a(n) for n = 1..210</a>
%F A224151 Empirical: a(n) = (1/87178291200)*n^14 + (1/4151347200)*n^13 + (1/136857600)*n^12 + (19/106444800)*n^11 + (53/12441600)*n^10 + (121/1382400)*n^9 + (1007857/609638400)*n^8 + (427321/29030400)*n^7 + (5519/62208)*n^6 + (217709/604800)*n^5 + (8736011/8553600)*n^4 + (1790117/950400)*n^3 + (90367957/37837800)*n^2 + (49717/40040)*n + 1
%e A224151 Some solutions for n=3
%e A224151 ..0..0..0....0..0..0....0..0..0....1..1..0....0..0..0....1..1..1....0..1..0
%e A224151 ..0..1..0....0..0..0....0..0..0....1..1..1....0..1..0....1..1..1....0..1..0
%e A224151 ..0..1..0....0..1..0....0..0..0....1..1..1....0..1..0....1..1..1....0..1..1
%e A224151 ..0..1..0....0..1..1....0..0..0....1..1..1....0..1..0....1..1..1....0..1..1
%e A224151 ..0..1..1....0..1..1....0..1..1....1..1..1....1..1..0....1..1..1....1..1..1
%e A224151 ..0..1..1....0..1..1....0..1..1....1..1..1....1..1..0....1..1..1....1..1..1
%e A224151 ..1..1..1....1..1..1....0..1..1....1..1..1....1..1..1....1..1..1....1..1..1
%K A224151 nonn
%O A224151 1,1
%A A224151 _R. H. Hardin_ Mar 31 2013