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.

A234760 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.

Original entry on oeis.org

110, 1014, 1014, 8968, 26642, 8968, 80010, 646036, 646036, 80010, 712722, 15939010, 41065150, 15939010, 712722, 6350732, 392044622, 2683721676, 2683721676, 392044622, 6350732, 56585338, 9648827736, 174451064914, 469243923298
Offset: 1

Views

Author

R. H. Hardin, Dec 30 2013

Keywords

Comments

Table starts
.....110.......1014...........8968.............80010...............712722
....1014......26642.........646036..........15939010............392044622
....8968.....646036.......41065150........2683721676.........174451064914
...80010...15939010.....2683721676......469243923298.......81436516016562
..712722..392044622...174451064914....81436516016562....37650372740746368
.6350732.9648827736.11352560005654.14155719250115192.17443322778721788150

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 8*a(n-1) +10*a(n-2) -16*a(n-3) -8*a(n-4) +4*a(n-5) +a(n-6)
k=2: [order 17]
k=3: [order 55]