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

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A218811

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

A218811

Hilltop maps: number of 2Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..3 2Xn array
(history; published version)

#4 by R. H. Hardin at Tue Nov 06 17:44:00 EST 2012

STATUS

editing

approved

#3 by R. H. Hardin at Tue Nov 06 17:43:56 EST 2012

LINKS

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

#2 by R. H. Hardin at Tue Nov 06 17:43:41 EST 2012

	NAME	`allocated for R. H. Hardin` `Hilltop maps: number of 2Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..3 2Xn array`
	DATA	`1, 15, 61, 249, 993, 3969, 15871, 63467, 253797, 1014889, 4058377, 16228793, 64896323, 259509919, 1037738269, 4149747805, 16594171517, 66357412857, 265352580967, 1061102131539, 4243176114789, 16967776245057, 67851397847697`
	OFFSET	`1,2`
	COMMENTS	`Row 2 of A218810`
	FORMULA	`Empirical: a(n) = 3a(n-1) +3a(n-2) +3a(n-3) +3a(n-4) +3a(n-5) +a(n-6) +5a(n-7) +2a(n-8) +2a(n-9) +2a(n-10) +2a(n-11) +a(n-12) +a(n-13) -a(n-14) -a(n-15) -a(n-16) -a(n-17) -a(n-18) -a(n-19) for n>20`
	EXAMPLE	`Some solutions for n=3` `..0..1..1....1..1..1....0..1..0....0..0..0....1..1..1....1..0..1....0..0..0` `..1..0..0....1..1..1....1..1..0....1..1..0....0..1..1....0..1..1....1..1..1`
	KEYWORD	`allocated` `nonn`
	AUTHOR	`R. H. Hardin Nov 06 2012`
	STATUS	`approved` `editing`

#1 by R. H. Hardin at Tue Nov 06 17:36:26 EST 2012

	NAME	`allocated for R. H. Hardin`
	KEYWORD	`allocated`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 20:50 EDT 2024. Contains 375284 sequences. (Running on oeis4.)