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.

A189589 Number of permutations of 1..n with displacements restricted to {-5,-4,-2,-1,0,3}.

Original entry on oeis.org

1, 1, 1, 4, 10, 22, 59, 141, 299, 632, 1428, 3354, 7559, 17051, 39011, 88596, 199718, 450804, 1024183, 2325465, 5263935, 11925661, 27045401, 61298900, 138851955, 314630019, 713229703, 1616454503, 3662850431, 8300898385, 18813133993
Offset: 1

Views

Author

R. H. Hardin Apr 24 2011

Keywords

Examples

			Some solutions for n=10
..1....1....1....1....5....1....1....2....6....5....6....1....1....2....1....3
..3....2....2....2....3....4....2....4....4....6....2....2....2....3....2....2
..4....3....4....3....4....5....5....3....3....3....8....8....3....4....3....4
..8....4....8....4....1....6....6....1....1....1....1....4....4....1....8....1
..2....5....5....6....2....2...10....5....2....2....7....5....5....5....5....9
..7....6....3....7....6....3....3....8....7...10....3....3....7....6...10...10
..9....8....9....8....8....9....4....7....8....4....4....7....8....8....4....8
..5....9...10....5....9....8....8....9....5....8....5....9....9....9....9....5
..6...10....6....9...10...10....9....6....9....9....9....6....6...10....6....6
.10....7....7...10....7....7....7...10...10....7...10...10...10....7....7....7
		

Formula

Empirical: a(n) = a(n-1) +a(n-3) +6*a(n-4) +5*a(n-5) +4*a(n-6) +28*a(n-7) +35*a(n-8) -18*a(n-9) +39*a(n-10) -10*a(n-11) -90*a(n-12) -28*a(n-13) -83*a(n-14) -132*a(n-15) -247*a(n-16) +24*a(n-17) -149*a(n-18) +65*a(n-19) +387*a(n-20) +108*a(n-21) +172*a(n-22) +153*a(n-23) +390*a(n-24) -147*a(n-25) +233*a(n-26) -125*a(n-27) -540*a(n-28) -2*a(n-29) -123*a(n-30) +16*a(n-31) -205*a(n-32) +151*a(n-33) -195*a(n-34) +36*a(n-35) +278*a(n-36) -85*a(n-37) +38*a(n-38) -a(n-39) +117*a(n-40) -43*a(n-41) +23*a(n-42) -21*a(n-43) -47*a(n-44) +13*a(n-45) +9*a(n-46) -10*a(n-47) -17*a(n-48) +6*a(n-49) -a(n-50) +a(n-51) +3*a(n-52) +a(n-53) -a(n-54) +a(n-55) +a(n-56)