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-11 of 11 results.

A250282 Number of length 7+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

128, 2763, 20252, 107387, 381812, 1154141, 2908232, 6704631, 13816144, 26741121, 48197940, 83583525, 137527528, 219303553, 336659016, 505804957, 737614588, 1056435849, 1478402044, 2041032531, 2764805264
Offset: 1

Views

Author

R. H. Hardin, Nov 16 2014

Keywords

Comments

Row 7 of A250277

Examples

			Some solutions for n=4
..0....4....2....2....4....0....3....0....0....2....2....0....1....3....4....1
..1....2....2....0....0....1....1....3....1....1....4....1....1....1....1....1
..4....2....1....1....3....3....1....2....4....4....0....4....4....3....3....3
..2....4....4....4....2....0....3....0....4....2....3....0....4....0....1....2
..1....1....2....2....1....4....3....4....3....2....2....2....1....4....0....1
..2....0....1....2....4....1....4....4....1....0....0....2....4....3....0....1
..4....0....0....3....0....1....1....1....4....2....1....3....4....0....1....2
..4....0....2....4....0....0....1....0....2....0....2....0....1....1....0....1
Previous Showing 11-11 of 11 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.