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.

A183882 Number of arrangements of n+2 numbers in 0..7 with each number being the sum mod 8 of two others.

Original entry on oeis.org

4, 35, 1986, 52827, 885690, 10540371, 104446714, 938543435, 7996169226, 66170227587, 538977760842, 4352945018619, 34996920361210, 280699272183347, 2248598404709850, 18001206351037995, 144060870372238122
Offset: 1

Views

Author

R. H. Hardin Jan 07 2011

Keywords

Comments

Column 7 of A183884

Examples

			Some solutions for n=2
..6....6....2....2....0....2....6....4....4....4....6....4....6....6....4....2
..6....2....6....6....4....4....6....4....0....2....4....0....2....2....6....6
..4....2....4....6....0....6....2....0....4....2....2....4....6....4....6....2
..2....4....2....4....4....2....4....0....0....6....6....4....4....2....2....4