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.

Previous Showing 11-13 of 13 results.

A239410 Number of 6Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.

Original entry on oeis.org

156, 20818, 2590704, 326882784, 40566958960, 5072216819342, 630657074443394, 78666433617260802, 9791612259389470778, 1220385596630190836830, 151973853622892194440357, 18935435888110044394225594
Offset: 1

Views

Author

R. H. Hardin, Mar 17 2014

Keywords

Comments

Row 6 of A239405

Examples

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

A239411 Number of 7 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.

Original entry on oeis.org

368, 113774, 32507376, 9402398952, 2671846338458, 765206237815409, 217822754771248124, 62224253930396430225, 17732860047914475927901, 5061141668045083629968143, 1443095146623473513048203207
Offset: 1

Views

Author

R. H. Hardin, Mar 17 2014

Keywords

Comments

Row 7 of A239405.

Examples

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

Crossrefs

Cf. A239405.

A239398 Number of n X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4.

Original entry on oeis.org

2, 23, 1337, 394509, 614216271, 5072216819342, 217822754771248124, 49235710631611399112515, 58260708510317695923927600575
Offset: 1

Views

Author

R. H. Hardin, Mar 17 2014

Keywords

Comments

Diagonal of A239405.

Examples

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

Crossrefs

Cf. A239405.
Previous Showing 11-13 of 13 results.