The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A264301 Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-2 1,0 or -1,0. 1
 0, 9, 8, 24, 177, 288, 944, 4209, 9944, 31600, 113089, 312608, 983848, 3234633, 9575536, 29951792, 95173345, 289918848, 903912384, 2833959393, 8735891856, 27192328832, 84804247873, 262692360640, 817037308944, 2542805972809 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Row 2 of A264299. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 2*a(n-1) -a(n-2) +19*a(n-3) -22*a(n-4) +35*a(n-5) -55*a(n-6) +46*a(n-7) -103*a(n-8) -27*a(n-9) -106*a(n-10) +133*a(n-11) +270*a(n-12) +548*a(n-13) -330*a(n-14) -218*a(n-15) -1668*a(n-16) +622*a(n-17) -350*a(n-18) +2004*a(n-19) -766*a(n-20) +922*a(n-21) -1476*a(n-22) +522*a(n-23) -493*a(n-24) +586*a(n-25) -133*a(n-26) +135*a(n-27) -118*a(n-28) +31*a(n-29) -11*a(n-30) +14*a(n-31) -11*a(n-32) +a(n-33) -2*a(n-34) +a(n-35) EXAMPLE Some solutions for n=4 ..2..0..4..8..3....2..3..4..8..9....5..0..4..2..3....5..0..1..2..9 .10..1..9..7.14....0..1..6..7.14...10..1..9..7.14....7.11..6..3..4 ..5..6.11.12.13....5.10.11.12.13...12..6.11..8.13...12.10.14..8.13 CROSSREFS Cf. A264299. Sequence in context: A340446 A063561 A068823 * A251091 A159078 A253090 Adjacent sequences:  A264298 A264299 A264300 * A264302 A264303 A264304 KEYWORD nonn AUTHOR R. H. Hardin, Nov 11 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 22:26 EDT 2021. Contains 344004 sequences. (Running on oeis4.)