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.

A189607 Number of nX6 array permutations with each element not moving, or moving one space E, S or NW.

This page as a plain text file.
%I A189607 #7 Jul 22 2025 11:50:14
%S A189607 1,60,912,17617,321815,5897476,107793872,1968061359,35917517449,
%T A189607 655347656612,11956214759290,218119695889901,3979116037755048,
%U A189607 72589531392230391,1324217776135660990,24157052394845982633
%N A189607 Number of nX6 array permutations with each element not moving, or moving one space E, S or NW.
%C A189607 Column 6 of A189610
%H A189607 R. H. Hardin, <a href="/A189607/b189607.txt">Table of n, a(n) for n = 1..200</a>
%F A189607 Empirical: a(n) = 27*a(n-1) -127*a(n-2) -740*a(n-3) +747*a(n-4) +34995*a(n-5) -5506*a(n-6) -248292*a(n-7) -1174016*a(n-8) +1007958*a(n-9) -6861339*a(n-10) +41430256*a(n-11) +51611008*a(n-12) +198872876*a(n-13) -868258957*a(n-14) +1605556233*a(n-15) -7531204340*a(n-16) +1848561932*a(n-17) +6186956818*a(n-18) -4662718722*a(n-19) +45191482278*a(n-20) +97124216354*a(n-21) -55135475594*a(n-22) -27287536597*a(n-23) -171514334842*a(n-24) -726729691066*a(n-25) -629428131178*a(n-26) +173178060771*a(n-27) +427006220020*a(n-28) +2317766584100*a(n-29) +4411572299192*a(n-30) +3018492633598*a(n-31) -49374942909*a(n-32) -3044087792460*a(n-33) -10242069320303*a(n-34) -13737406955417*a(n-35) -8647612812832*a(n-36) -447720866054*a(n-37) +8671998792069*a(n-38) +20571483610312*a(n-39) +21760073504185*a(n-40) +12564766054592*a(n-41) -39461914321*a(n-42) -12111944579432*a(n-43) -21521945563638*a(n-44) -18557201154461*a(n-45) -9762845716612*a(n-46) +1789973055064*a(n-47) +9250208603329*a(n-48) +12844537868975*a(n-49) +9355142418757*a(n-50) +4273826939521*a(n-51) -1198279677480*a(n-52) -3756392714910*a(n-53) -4341134125770*a(n-54) -2896130615108*a(n-55) -1279535523194*a(n-56) +117809240013*a(n-57) +724830885103*a(n-58) +833606712872*a(n-59) +593545615487*a(n-60) +315058164501*a(n-61) +91626028809*a(n-62) -22707962227*a(n-63) -62984709313*a(n-64) -59302149654*a(n-65) -42411923185*a(n-66) -25348175173*a(n-67) -13452835237*a(n-68) -6385446334*a(n-69) -2765569003*a(n-70) -1092490969*a(n-71) -398969847*a(n-72) -133968639*a(n-73) -41534265*a(n-74) -11796130*a(n-75) -3102673*a(n-76) -750560*a(n-77) -165926*a(n-78) -32497*a(n-79) -5745*a(n-80) -925*a(n-81) -136*a(n-82) -15*a(n-83) -a(n-84) for n>85
%e A189607 Some solutions for 3X6
%e A189607 ..0..8..2.10..3..5....0..1..2..3.11..5....0..1..9..3.11..4....0..1..2.10.11..4
%e A189607 ..6..1.15..9..4.11....6..7.15..9..4.10...13..6..2..8.10..5....6.14..8..3..9..5
%e A189607 .12..7.13.14.16.17...12.13..8.14.16.17...12..7.14.15.16.17...12..7.13.15.16.17
%K A189607 nonn
%O A189607 1,2
%A A189607 _R. H. Hardin_ Apr 24 2011