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.

A239340 T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or three plus the sum of the elements above it, modulo 4.

Original entry on oeis.org

2, 5, 5, 12, 31, 12, 28, 172, 172, 28, 66, 926, 2187, 926, 66, 156, 5078, 27341, 27341, 5078, 156, 368, 27861, 346028, 790681, 346028, 27861, 368, 868, 152260, 4360887, 22952323, 22952323, 4360887, 152260, 868, 2048, 832207, 54774178, 663249556
Offset: 1

Views

Author

R. H. Hardin, Mar 16 2014

Keywords

Comments

Table starts
....2.......5.........12.............28................66..................156
....5......31........172............926..............5078................27861
...12.....172.......2187..........27341............346028..............4360887
...28.....926......27341.........790681..........22952323............663249556
...66....5078.....346028.......22952323........1527488498.........101276030555
..156...27861....4360887......663249556......101276030555.......15397080750829
..368..152260...54774178....19117551262.....6693244281896.....2331550702010844
..868..832207..688266175...550960518608...442014330398515...352742924096563362
.2048.4550810.8649330696.15873533676775.29178369838713161.53342694175522093768

Examples

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

Formula

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