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.

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

Original entry on oeis.org

1, 31, 1761, 75451, 1598395, 23327655, 275846173, 2895194179, 28388585391, 267809160367, 2472279047473, 22552186971627, 204400652073763, 1846262280059767, 16646854130219781, 149959684159252819
Offset: 1

Views

Author

R. H. Hardin Jan 07 2011

Keywords

Comments

Column 8 of A183884

Examples

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