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.

A265923 Number of n X 3 0..4 arrays with the absolute differences of each element with its with horizontal and antidiagonal neighbors unique.

Original entry on oeis.org

92, 1740, 17936, 174000, 1671744, 15962560, 152267520, 1451371264, 13834836992, 131883277312, 1257236156416, 11986527891456, 114277874876416, 1089597587963904, 10388632576131072, 99054000222699520, 944443268554031104, 9005175397018238976, 85862124616319762432
Offset: 1

Views

Author

R. H. Hardin, Dec 18 2015

Keywords

Examples

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

Crossrefs

Column 3 of A265928.

Formula

Empirical: a(n) = 8*a(n-1) +96*a(n-2) -736*a(n-3) -2464*a(n-4) +20480*a(n-5) +13312*a(n-6) -196096*a(n-7) +78592*a(n-8) +600064*a(n-9) -589824*a(n-10) for n>13.