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.

A263124 T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

14, 36, 29, 168, 148, 59, 912, 1664, 522, 119, 52446, 28048, 10356, 1708, 238, 502800, 887805, 316392, 56288, 5124, 477, 5950176, 21881010, 17782827, 3049840, 238104, 15640, 955, 79674864, 583371100, 881938092, 344322375, 16751376, 1294448, 47602
Offset: 1

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Table starts
...14.....36......168........912........52446........502800.......5950176
...29....148.....1664......28048.......887805......21881010.....583371100
...59....522....10356.....316392.....17782827.....881938092...47672389112
..119...1708....56288....3049840....344322375...33563774112.3600054345088
..238...5124...238104...16751376...6946980030.1213776549696
..477..15640..1294448..216762400.113558538589
..955..47602..6844676.2168966344
.1911.144236.35274768
.3822.432708
.7645

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 2*a(n-1) +a(n-4) -2*a(n-5)
k=2: [order 46]