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

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

A209508

Half the number of (n+1)X6 0..2 arrays with every 2X2 subblock having two or four distinct clockwise edge differences
(history; published version)

#5 by Russ Cox at Sat Mar 31 12:37:29 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Mar 09 2012

Discussion
Sat Mar 31	12:37	OEIS Server: https://oeis.org/edit/global/875

#4 by Ron Hardin at Fri Mar 09 20:31:09 EST 2012

STATUS

editing

approved

#3 by Ron Hardin at Fri Mar 09 20:31:06 EST 2012

LINKS

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

#2 by Ron Hardin at Fri Mar 09 20:30:48 EST 2012

	NAME	`allocatedHalf the number of (n+1)X6 0..2 arrays with every 2X2 subblock having two or four distinct forclockwise Ronedge Hardindifferences`
	DATA	`729, 11673, 189801, 3102219, 50798448, 832374135, 13642432110, 223616134827, 3665458427859, 60083950172598, 984896234494740, 16144445659742595, 264640335145278948, 4337994781387301094, 71108586231270845148`
	OFFSET	`1,1`
	COMMENTS	`Column 5 of A209511`
	FORMULA	`Empirical: a(n) = 30a(n-1) -291a(n-2) +1278a(n-3) -2901a(n-4) +3519a(n-5) -2152a(n-6) +516*a(n-7)`
	EXAMPLE	`Some solutions for n=4` `..0..1..2..0..2..0....1..2..0..1..2..0....1..2..0..1..2..1....1..2..1..2..0..1` `..1..2..0..1..0..1....2..0..2..0..1..2....0..1..2..0..1..2....2..1..0..1..2..0` `..0..1..2..0..2..0....0..2..0..1..2..1....1..2..1..2..0..1....1..0..1..2..0..1` `..2..0..1..2..0..2....1..0..2..0..1..2....2..0..2..0..2..0....0..1..0..1..2..0` `..0..1..2..0..2..0....0..1..0..1..2..0....0..1..0..1..0..2....2..0..1..0..1..2`
	KEYWORD	`allocated` `nonn`
	AUTHOR	`R. H. Hardin (rhhardin(AT)att.net) Mar 09 2012`
	STATUS	`approved` `editing`

#1 by Ron Hardin at Fri Mar 09 20:25:40 EST 2012

Last modified August 29 18:31 EDT 2024. Contains 375518 sequences. (Running on oeis4.)