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.

A223237 Rolling icosahedron footprints: number of 5Xn 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

20736, 142805, 26157625, 2191464605, 266409703885, 27049155640325, 3010781803380625, 319668431152592585, 34788800528856366205, 3737470592349481922045, 404261376372354175571785
Offset: 1

Views

Author

R. H. Hardin Mar 18 2013

Keywords

Comments

Row 5 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...10..6..0....4..6..0....0..6..0....4..6..0....0..6..0....4..6..0
..0..2..0....0..6..2....5..6..0....0..5.10...10..6..2....0..7..5....0..6..4
..0..5..0...10..6..4....0..7..5....0..5..6....5..6..4....0..6..5....4..2..0
..6..5..6...10..6..5....0..7.11....0..5.10....0..6..5....2..6..4....0..2..8
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