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.

A239851 Number of n X 1 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.

Original entry on oeis.org

2, 2, 4, 6, 8, 14, 20, 30, 48, 70, 108, 166, 248, 382, 580, 878, 1344, 2038, 3100, 4726, 7176, 10926, 16628, 25278, 38480, 58534, 89036, 135494, 206104, 313566, 477092, 725774, 1104224, 1679958, 2555772, 3888406, 5915688, 8999950, 13692500
Offset: 1

Views

Author

R. H. Hardin, Mar 28 2014

Keywords

Comments

Column 1 of A239858.

Examples

			All solutions for n=4:
..3....3....2....2....2....3
..2....2....3....3....3....2
..3....3....3....2....3....2
..2....3....3....2....2....2
		

Formula

Empirical: a(n) = a(n-2) +2*a(n-3).
Empirical g.f.: 2*x*(1 + x + x^2) / (1 - x^2 - 2*x^3). - Colin Barker, Feb 18 2018