The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A236814

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal
(history; published version)

#5 by Russ Cox at Mon Aug 11 22:46:09 EDT 2014

LINKS

R. H. Hardin, <a href="/A236814/a236814.txt">Empirical recurrence of order 87</a>

Discussion

Mon Aug 11

22:46

OEIS Server: https://oeis.org/edit/global/2322

#4 by R. H. Hardin at Fri Jan 31 06:44:17 EST 2014

STATUS

editing

approved

#3 by R. H. Hardin at Fri Jan 31 06:44:14 EST 2014

LINKS

R. H. Hardin, <a href="/A236814/a236814.txt">Empirical recurrence of order 87</a>

R. H. Hardin, <a href="/A236814/b236814.txt">Table of n, a(n) for n = 1..210</a>

#2 by R. H. Hardin at Fri Jan 31 06:43:25 EST 2014

NAME

allocated for R. H. Hardin

Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal

DATA

1162, 10702, 98380, 956456, 9360398, 93804194, 947327860, 9682975968, 99543701888, 1030061727604, 10698831856789, 111533815357066, 1165405418509395, 12202784081035254, 127950763324803502

OFFSET

1,1

COMMENTS

Column 3 of A236819

FORMULA

Empirical recurrence of order 87 (see link above)

EXAMPLE

Some solutions for n=3

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Jan 31 2014

STATUS

approved

editing

#1 by R. H. Hardin at Fri Jan 31 06:39:42 EST 2014

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved