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.

A224192 Number of 5Xn 0..2 arrays with rows unimodal and columns nondecreasing.

This page as a plain text file.
%I A224192 #6 Jul 23 2025 05:02:12
%S A224192 21,441,5852,55438,408222,2469182,12741432,57644194,233385140,
%T A224192 859145920,2912085006,9181289736,27151590510,75840301088,201262238349,
%U A224192 509972027785,1239109721281,2897739996141,6543276177902,14306873805792,30366198279340
%N A224192 Number of 5Xn 0..2 arrays with rows unimodal and columns nondecreasing.
%C A224192 Row 5 of A224190
%H A224192 R. H. Hardin, <a href="/A224192/b224192.txt">Table of n, a(n) for n = 1..210</a>
%F A224192 Empirical: a(n) = (1/1379196149760000)*n^20 + (1/12538146816000)*n^19 + (467/101624979456000)*n^18 + (223/1302884352000)*n^17 + (9641/2134978560000)*n^16 + (44237/498161664000)*n^15 + (115879/86102016000)*n^14 + (24029081/1494484992000)*n^13 + (623419/4055040000)*n^12 + (18199033/15328051200)*n^11 + (3421967251/459841536000)*n^10 + (263944057/6967296000)*n^9 + (8168948285977/52306974720000)*n^8 + (193145489021/373621248000)*n^7 + (507138710909/373621248000)*n^6 + (13262560631/4790016000)*n^5 + (3783062210933/882161280000)*n^4 + (108121887773/22054032000)*n^3 + (27314271011/6518191680)*n^2 + (14737223/8314020)*n + 1
%e A224192 Some solutions for n=3
%e A224192 ..1..2..0....0..1..0....0..1..0....0..0..0....0..2..1....0..0..2....1..1..0
%e A224192 ..1..2..0....1..1..1....0..1..0....0..0..0....0..2..1....0..1..2....1..1..0
%e A224192 ..2..2..0....2..1..1....0..1..2....1..2..1....0..2..1....1..2..2....2..2..0
%e A224192 ..2..2..1....2..2..1....0..2..2....1..2..1....1..2..2....1..2..2....2..2..1
%e A224192 ..2..2..2....2..2..2....1..2..2....2..2..2....1..2..2....2..2..2....2..2..1
%K A224192 nonn
%O A224192 1,1
%A A224192 _R. H. Hardin_ Apr 01 2013