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.

A246895 Number of length 3+4 0..n arrays with some pair in every consecutive five terms totalling exactly n.

Original entry on oeis.org

112, 1961, 12544, 57585, 177648, 484297, 1079680, 2256929, 4207600, 7537641, 12554112, 20344081, 31352944, 47355785, 68954368, 98858817, 137838960, 189828649, 255769600, 341151281, 447081712, 580982601, 744111744, 946245985
Offset: 1

Views

Author

R. H. Hardin, Sep 06 2014

Keywords

Comments

Row 3 of A246892

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) +4*a(n-2) -10*a(n-3) -5*a(n-4) +20*a(n-5) -20*a(n-7) +5*a(n-8) +10*a(n-9) -4*a(n-10) -2*a(n-11) +a(n-12)