cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A217965 Number of 2Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..2 2Xn array.

Original entry on oeis.org

9, 17, 91, 321, 1341, 5269, 21379, 85633, 344955, 1386679, 5579199, 22440525, 90271591, 363117835, 1460674773, 5875648527, 23635221447, 95074256043, 382442764281, 1538402105163, 6188327969265, 24892972759953, 100133687989929
Offset: 1

Views

Author

R. H. Hardin Oct 16 2012

Keywords

Comments

Row 2 of A217964

Examples

			Some solutions for n=3
..1..0..0....0..0..1....0..0..2....2..0..1....2..1..2....0..0..0....2..1..1
..1..0..0....1..1..2....1..1..1....0..0..2....1..1..1....1..0..1....1..0..0
		

Formula

Empirical: a(n) = 2*a(n-1) +7*a(n-2) +6*a(n-3) -2*a(n-4) -10*a(n-5) -11*a(n-6) -32*a(n-7) -23*a(n-8) -16*a(n-9) +22*a(n-10) +4*a(n-11)