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.

A190837 Number of permutations of 8 copies of 1..n introduced in order 1..n with no element equal to another within a distance of 1.

Original entry on oeis.org

1, 0, 1, 400598, 1530622143864, 28920026907938624194, 2070756746775910218326948065, 459408385876250801291447710561829082, 271259741131895052775392614041761701799270286, 379065045836307787068046364731543393514652159389593652
Offset: 0

Views

Author

R. H. Hardin, May 21 2011

Keywords

Examples

			Some solutions for n=3
..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....1
..2....2....2....2....2....2....2....2....2....2....2....2....2....2....2....2
..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....1
..2....2....2....3....2....3....2....2....3....2....2....2....3....2....2....2
..3....3....3....1....3....1....1....1....1....1....1....3....1....3....3....3
..2....1....1....3....1....2....2....3....2....3....3....1....3....1....2....1
..3....3....2....1....2....1....3....2....3....1....1....3....1....3....3....2
..1....2....3....2....1....2....1....1....2....3....3....2....2....2....2....3
..3....1....1....1....3....1....2....3....3....2....1....1....3....3....3....2
..1....3....2....2....2....2....1....2....1....1....2....3....1....1....2....3
..2....1....1....1....3....3....3....1....3....3....1....2....3....3....3....1
..1....3....3....3....1....1....1....2....1....2....2....3....2....2....1....3
..2....2....1....2....3....3....2....3....3....3....3....2....3....3....2....2
..3....3....3....3....1....1....3....1....2....2....2....3....2....2....1....3
..1....1....2....2....3....3....2....3....1....3....3....1....1....3....2....1
..3....3....3....3....2....2....3....2....3....2....1....3....3....1....3....3
..2....2....1....1....3....3....1....3....2....1....2....1....2....3....1....2
..1....3....3....3....2....2....3....2....3....3....3....2....1....2....3....1
..3....2....2....2....3....1....1....1....2....2....2....1....2....3....1....2
..2....1....3....3....1....3....3....3....3....3....3....3....3....1....3....3
..3....2....1....2....2....2....2....1....2....1....1....1....2....2....1....1
..1....3....2....3....1....3....3....3....1....3....3....2....1....1....3....3
..2....2....3....1....3....2....2....2....2....2....2....3....3....2....2....2
..3....1....2....2....2....3....3....3....1....1....3....2....2....1....1....1
		

Crossrefs

Row n=8 of A322013.

Formula

a(n) ~ sqrt(8) * 131072^n * n^(7*n) / (315^n * exp(7*n + 7)). - Vaclav Kotesovec, Nov 24 2018

Extensions

a(0)=1 prepended and a(7)-a(9) added by Seiichi Manyama, Nov 16 2018