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.

A223238 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, diagonal or antidiagonal neighbor moves along an icosahedral edge.

Original entry on oeis.org

248832, 1856465, 842416625, 146259564725, 42210625593305, 9343721361109325, 2410480042269361205, 569856683384487837845, 141861478546517230929185, 34264186727962091778301265, 8425769874595179617059603645
Offset: 1

Views

Author

R. H. Hardin Mar 18 2013

Keywords

Comments

Row 6 of A223233

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
..2..6..0....0..6..0....0..6..0....0..6..0....2..6..0....4..6..0....2..6..0
..0..6.10....0..7..5....0..5.10....2..1..0....4..6..4....4..2..0....0..6..2
.10..6.10....0..6..0...11..5.11....8..1..0....4..6..5....8..2..6....4..6..5
.10..4..2....0..7..0...11..5..6....8..1..0....5..6.10....1..2..1....4..6.10
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