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.

A223326 Rolling icosahedron footprints: number of 6Xn 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal or antidiagonal neighbor moves along an icosahedral edge.

Original entry on oeis.org

248832, 48828125, 29007265625, 17232311481125, 10739266230499625, 6765094542682458125, 4288761014162797342625, 2725466174591233186641125, 1733931516143286321479437625, 1103604638130169667481962994125
Offset: 1

Views

Author

R. H. Hardin Mar 19 2013

Keywords

Comments

Row 6 of A223321

Examples

			Some solutions for n=3
..0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0
..0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0
..0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0....0..6..0
..0..1..0....0..2..1....0..1..8....0..6..4....0..2..1....0..1..2....0..7.11
..7..1..0....1..0..2....8..3..1....4..2..0....1..8..2....8..4..2....5..7..3
..3..1..0....1..8..2....9..3..8....0..7..3....2..6..2....8..4.10....3..7..0
Vertex neighbors:
0 -> 1 2 5 6 7
1 -> 0 2 3 7 8
2 -> 0 1 4 6 8
3 -> 1 7 8 9 11
4 -> 2 6 8 9 10
5 -> 0 6 7 10 11
6 -> 0 2 4 5 10
7 -> 0 1 3 5 11
8 -> 1 2 3 4 9
9 -> 3 4 8 10 11
10 -> 4 5 6 9 11
11 -> 3 5 7 9 10