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.

A263224 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

1, 2, 2, 4, 14, 4, 7, 72, 72, 7, 13, 343, 1009, 343, 13, 26, 1920, 12601, 12601, 1920, 26, 52, 11444, 198892, 475539, 198892, 11444, 52, 103, 68112, 3345984, 22342751, 22342751, 3345984, 68112, 103, 205, 405019, 56362801, 1094138875, 3126162435
Offset: 1

Views

Author

R. H. Hardin, Oct 12 2015

Keywords

Comments

Table starts
...1......2.........4.............7...............13...................26
...2.....14........72...........343.............1920................11444
...4.....72......1009.........12601...........198892..............3345984
...7....343.....12601........475539.........22342751...........1094138875
..13...1920....198892......22342751.......3126162435.........456363243352
..26..11444...3345984....1094138875.....456363243352......199878687706434
..52..68112..56362801...53375395657...66317081173996....87072717791078712
.103.405019.951167305.2607171566653.9651690803653879.37998530090131229539

Examples

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

Crossrefs

Column 1 is A262267(n-1).

Formula

Empirical for column k:
k=1: a(n) = 3*a(n-1) -3*a(n-2) +3*a(n-3) -2*a(n-4)
k=2: [order 16]
k=3: [order 26]
k=4: [order 89]