The On-Line Encyclopedia of Integer Sequences® (OEIS®)

Revision History for A236636 (Underlined text is an addition; strikethrough text is a ~~deletion~~.)
Showing all changes.

A236636

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

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

LINKS

R. H. Hardin, <a href="/A236636/a236636.txt">Empirical recurrence of order 72</a>

Discussion
Mon Aug 11	22:46	OEIS Server: https://oeis.org/edit/global/2322

#4 by R. H. Hardin at Wed Jan 29 09:56:14 EST 2014

STATUS

editing

approved

#3 by R. H. Hardin at Wed Jan 29 09:56:10 EST 2014

LINKS

R. H. Hardin, <a href="/A236636/a236636.txt">Empirical recurrence of order 72</a>

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

#2 by R. H. Hardin at Wed Jan 29 09:55:30 EST 2014

	NAME	`allocated for R. H. Hardin` `Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the upper median plus the minimum of every 2X2 subblock`
	DATA	`474, 4176, 37018, 334180, 2988228, 26755684, 239823278, 2152052046, 19284072120, 172791130750, 1548885972816, 13886350823992, 124465875300538, 1115550628999210, 9999316448921006, 89632910699558058, 803421988230512594`
	OFFSET	`1,1`
	COMMENTS	`Column 2 of A236640`
	FORMULA	`Empirical recurrence of order 72 (see link above)`
	EXAMPLE	`Some solutions for n=3` `..0..0..2....1..0..1....2..2..0....1..2..0....0..2..2....2..0..0....1..2..2` `..1..1..0....1..0..0....1..1..1....2..1..2....0..1..2....2..1..1....1..1..1` `..1..1..1....2..1..1....1..2..2....1..1..2....1..0..0....0..1..2....0..0..2` `..2..2..1....0..2..2....1..0..0....1..0..1....2..0..2....2..2..1....0..0..0`
	KEYWORD	`allocated` `nonn`
	AUTHOR	`R. H. Hardin, Jan 29 2014`
	STATUS	`approved` `editing`

#1 by R. H. Hardin at Wed Jan 29 09:52:34 EST 2014

Last modified August 30 11:38 EDT 2024. Contains 375543 sequences. (Running on oeis4.)