login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264089 Number of (n+1) X (7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 0,1 or 2,-2. 1
1156, 319906, 88529281, 16552783250, 3094960562500, 607571415109250, 119272286997956401, 23427016036901713162, 4601446775332257716644, 903762093072758900829562, 177506328064889172764320801 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 7 of A264090.
LINKS
FORMULA
Empirical: a(n) = 191*a(n-1) +202888*a(n-3) +2664858*a(n-4) -292691454*a(n-5) -149076440*a(n-6) -281616002528*a(n-7) -1868443525595*a(n-8) +56521600999869*a(n-9) +304562174982304*a(n-10) +731901314288496*a(n-11) +6125815081982652*a(n-12) -146228997401036980*a(n-13) -805336219444262352*a(n-14) -601156663205496672*a(n-15) -7904172290266182151*a(n-16) +103348074099116322665*a(n-17) +565120003325128175904*a(n-18) -7788670746879012536*a(n-19) +3296935107187593446218*a(n-20) -5705746630599634018862*a(n-21) -14205213698988793068056*a(n-22) -84316541339682506453949*a(n-24) +84663930151168329709307*a(n-25) for n>27.
EXAMPLE
Some solutions for n=1
..0..1..2..4..3..5..6..7....0..2..1..4..3..5..7..6....0..2..1..3..5..4..7..6
..8..9.10.11.13.12.15.14....8.10..9.11.12.13.14.15....8..9.10.12.11.14.13.15
CROSSREFS
Cf. A264090.
Sequence in context: A034979 A189279 A264271 * A264278 A217279 A204478
KEYWORD
nonn
AUTHOR
R. H. Hardin, Nov 03 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)