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.

A249979 Number of length n+1 0..2*5 arrays with the sum of the absolute values of adjacent differences equal to n*5.

Original entry on oeis.org

12, 90, 728, 6252, 55372, 508902, 4598532, 43752328, 399919272, 3872197278, 35715136808, 349291390860, 3244120777620, 31938382591862, 298193263675024, 2949970866347064, 27653133418970008, 274591500744039956
Offset: 1

Views

Author

R. H. Hardin, Nov 10 2014

Keywords

Comments

Column 5 of A249982

Examples

			Some solutions for n=5
..4....7....3....8...10....8....7....4....7....8....0....4....8....5....7....9
..9....3....6...10....3....5...10....3....0....3....1....7....2....2....2....3
..2....7....3....2....4...10....7....1....7....9....9....3....6....9...10...10
..9....9....0....8...10....3....1...10....4....2....9....0....0....3....2....1
..4....0....9....1....3....9....8....3....9....5....1...10....1....6....1....2
..5....6....2....3....7....5....2....9....6....1....9....5....9....0....4....0