[go: up one dir, main page]

login
Revision History for A229796 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of 3 X 3 0..n arrays with rows and columns in lexicographically nondecreasing order.
(history; published version)
#7 by Bruno Berselli at Fri Sep 21 08:54:44 EDT 2018
STATUS

proposed

approved

#6 by Colin Barker at Fri Sep 21 08:52:33 EDT 2018
STATUS

editing

proposed

#5 by Colin Barker at Fri Sep 21 08:52:05 EDT 2018
NAME

Number of 3X3 3 X 3 0..n arrays with rows and columns in lexicographically nondecreasing order.

COMMENTS

Row 3 of A229794

FORMULA

Empirical: a(n) = (1/20)*n^9 + (11/24)*n^8 + (329/180)*n^7 + (1601/360)*n^6 + (545/72)*n^5 + (347/36)*n^4 + (3367/360)*n^3 + (313/45)*n^2 + (37/10)*n + 1.

Conjectures from Colin Barker, Sep 21 2018: (Start)

G.f.: x*(45 + 719*x + 4513*x^2 + 7676*x^3 + 4687*x^4 + 420*x^5 + 121*x^6 - 46*x^7 + 10*x^8 - x^9) / (1 - x)^10.

a(n) = 10*a(n-1) - 45*a(n-2) + 120*a(n-3) - 210*a(n-4) + 252*a(n-5) - 210*a(n-6) + 120*a(n-7) - 45*a(n-8) + 10*a(n-9) - a(n-10) for n>10.

(End)

EXAMPLE

Some solutions for n=2:

CROSSREFS

Row 3 of A229794.

STATUS

approved

editing

#4 by R. H. Hardin at Sun Sep 29 18:56:34 EDT 2013
STATUS

editing

approved

#3 by R. H. Hardin at Sun Sep 29 18:56:31 EDT 2013
LINKS

R. H. Hardin, <a href="/A229796/b229796.txt">Table of n, a(n) for n = 1..207</a>

#2 by R. H. Hardin at Sun Sep 29 18:56:16 EDT 2013
NAME

allocated for R. H. Hardin

Number of 3X3 0..n arrays with rows and columns in lexicographically nondecreasing order

DATA

45, 1169, 14178, 102251, 520017, 2066505, 6842284, 19692165, 50724037, 119421753, 261015470, 535936479, 1043365337, 1940082033, 3466044984, 5978361865, 9995569629, 16254413569, 25781605914, 39983353235, 60755768865, 90619631609

OFFSET

1,1

COMMENTS

Row 3 of A229794

FORMULA

Empirical: a(n) = (1/20)*n^9 + (11/24)*n^8 + (329/180)*n^7 + (1601/360)*n^6 + (545/72)*n^5 + (347/36)*n^4 + (3367/360)*n^3 + (313/45)*n^2 + (37/10)*n + 1

EXAMPLE

Some solutions for n=2

..0..1..1....0..0..2....0..0..0....1..1..2....1..1..1....0..2..2....0..2..2

..0..1..2....1..2..1....0..2..2....1..2..0....1..1..2....1..0..2....1..0..1

..2..1..0....2..0..1....0..2..2....2..0..1....2..2..1....1..2..2....1..2..1

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Sep 29 2013

STATUS

approved

editing

#1 by R. H. Hardin at Sun Sep 29 18:51:45 EDT 2013
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved