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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209095 Number of n X 3 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. 1
 5, 76, 1326, 23248, 407832, 7154944, 125526240, 2202232576, 38635976064, 677829707776, 11891846929920, 208630607073280, 3660216151873536, 64214845877125120, 1126585496573239296, 19764820171301257216 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 3 of A209100. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 20*a(n-1) - 44*a(n-2) + 16*a(n-3) for n>4. Conjectures from Colin Barker, Jul 08 2018: (Start) G.f.: x*(5 - 4*x)*(1 - 4*x + 2*x^2) / ((1 - 2*x)*(1 - 18*x + 8*x^2)). a(n) = 2^(n-3) + ((9-sqrt(73))^n*(-25+sqrt(73)) + (9+sqrt(73))^n*(25+sqrt(73))) / (16*sqrt(73)) for n>1. (End) EXAMPLE Some solutions for n=4: ..0..0..1....0..0..0....0..0..0....0..0..1....0..0..0....0..0..1....0..1..2 ..1..2..1....1..1..1....1..1..2....2..0..0....1..1..2....1..0..2....1..2..1 ..1..0..1....2..0..0....2..0..0....2..1..0....0..0..0....1..1..2....0..2..1 ..2..1..2....1..2..2....1..1..1....2..2..2....1..2..0....0..0..1....1..2..2 CROSSREFS Cf. A209100. Sequence in context: A277296 A364323 A011918 * A136300 A196689 A196725 Adjacent sequences: A209092 A209093 A209094 * A209096 A209097 A209098 KEYWORD nonn AUTHOR R. H. Hardin, Mar 05 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 2 13:44 EST 2024. Contains 370480 sequences. (Running on oeis4.)