The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A222144 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A222144

T(n,k) = number of n X k 0..4 arrays with no entry increasing mod 5 by 4 rightwards or downwards, starting with upper left zero.
(history; published version)

#16 by OEIS Server at Wed Jun 28 02:35:57 EDT 2017

LINKS

Andrew Howroyd, <a href="/A222144/b222144_2.txt">Table of n, a(n) for n = 1..378</a> (terms 1..127 from R. H. Hardin)

#15 by Michel Marcus at Wed Jun 28 02:35:57 EDT 2017

STATUS

reviewed

approved

Discussion

Wed Jun 28

02:35

OEIS Server: Installed new b-file as b222144.txt.  Old b-file is now b222144_2.txt.

#14 by Joerg Arndt at Wed Jun 28 02:13:16 EDT 2017

STATUS

proposed

reviewed

#13 by Michel Marcus at Wed Jun 28 01:43:42 EDT 2017

STATUS

editing

proposed

#12 by Michel Marcus at Wed Jun 28 01:43:38 EDT 2017

LINKS

Andrew Howroyd, <a href="/A222144/b222144_1.txt">Table of n, a(n) for n = 1..325</a> (terms 1..127 from R. H. Hardin)

STATUS

proposed

editing

#11 by Jon E. Schoenfield at Wed Jun 28 00:41:25 EDT 2017

STATUS

editing

proposed

#10 by Jon E. Schoenfield at Wed Jun 28 00:41:21 EDT 2017

NAME

T(n,k) =Number number of nXk n X k 0..4 arrays with no entry increasing mod 5 by 4 rightwards or downwards, starting with upper left zero.

EXAMPLE

Some solutions for n=3 , k=4:

STATUS

proposed

editing

#9 by Andrew Howroyd at Wed Jun 28 00:06:50 EDT 2017

STATUS

editing

proposed

#8 by Andrew Howroyd at Wed Jun 28 00:03:16 EDT 2017

LINKS

Andrew Howroyd, <a href="/A222144/b222144_2.txt">Table of n, a(n) for n = 1..378</a> (terms 1..127 from R. H. Hardin)

#7 by Andrew Howroyd at Tue Jun 27 23:14:28 EDT 2017

LINKS

R. H. Hardin, Andrew Howroyd, <a href="/A222144/b222144_1.txt">Table of n, a(n) for n = 1..325</a> (terms 1..127</a> from R. H. Hardin)

FORMULA

T(n,k) = 4 * (6*A198906(n,k) - 3*A207997(n,k) - 2) for n*k > 1. - Andrew Howroyd, Jun 27 2017