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.

A250645 Number of length n+1 0..7 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.

Original entry on oeis.org

1, 232, 296, 10766, 56088, 812004, 6290716, 61126790, 491825108, 4180573372, 33502889991, 273041099842, 2183663605890, 17568263304218, 140464317638347, 1125725667836824, 9002272474197863, 72061032003482452, 576368920287459218
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2014

Keywords

Comments

Column 7 of A250646

Examples

			Some solutions for n=5
..4....1....0....7....1....0....2....2....0....0....5....6....5....1....0....6
..4....1....3....3....0....6....2....5....4....2....7....4....3....4....3....7
..4....5....5....5....4....1....6....3....3....6....6....5....1....5....5....3
..1....7....3....4....6....3....1....7....3....5....4....2....7....7....4....0
..1....4....0....3....3....4....1....0....3....3....4....3....2....2....3....1
..3....4....0....0....3....7....1....4....6....0....4....3....0....5....7....2
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.