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.

A209098 Number of nX6 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

122, 24256, 5171088, 1118366188, 242632290432, 52675800891748, 11437585318270860, 2483525516352937680, 539268195586029921832, 117095796409143583455428, 25425988916932630731090072
Offset: 1

Views

Author

R. H. Hardin Mar 05 2012

Keywords

Comments

Column 6 of A209100

Examples

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

Formula

Empirical: a(n) = 300*a(n-1) -20582*a(n-2) +603924*a(n-3) -9449609*a(n-4) +91922233*a(n-5) -653230134*a(n-6) +4097861625*a(n-7) -24669590390*a(n-8) +130239438691*a(n-9) -543298308924*a(n-10) +1704347583868*a(n-11) -3917246807088*a(n-12) +6481693905844*a(n-13) -8041265672017*a(n-14) +9445340887084*a(n-15) -12785808828112*a(n-16) +12798888267640*a(n-17) -2070180454016*a(n-18) -7015258833920*a(n-19) +3949705789040*a(n-20) +2252604606848*a(n-21) -4177948981504*a(n-22) +3059510444288*a(n-23) -1376634560512*a(n-24) +343950082048*a(n-25) -46623096832*a(n-26) +4254072832*a(n-27) -150994944*a(n-28) for n>30