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.

A264494 Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having directed index change 2,-1 1,0 2,1 0,-1 -2,-2 or -1,0.

This page as a plain text file.
%I A264494 #6 Nov 14 2015 16:49:11
%S A264494 52,324,9714,142352,2517024,42169152,714303376,12077450784,
%T A264494 204161943712,3452345816640,58366975597504,986868844185984,
%U A264494 16685367542010496,282109578735300864,4769776075129487104,80645235669257971200
%N A264494 Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having directed index change 2,-1 1,0 2,1 0,-1 -2,-2 or -1,0.
%C A264494 Row 6 of A264490.
%H A264494 R. H. Hardin, <a href="/A264494/b264494.txt">Table of n, a(n) for n = 1..210</a>
%F A264494 Empirical: a(n) = 6*a(n-1) +154*a(n-2) +612*a(n-3) -744*a(n-4) -12624*a(n-5) -45792*a(n-6) -7488*a(n-7) +66816*a(n-8) +235008*a(n-9) -995328*a(n-10) for n>11
%e A264494 Some solutions for n=4
%e A264494 ..5..2..7..4..9....1..6.14..8..9...12.13.14..8..9...12..2..7..4..9
%e A264494 .10..1.12.13.14...10..7..2.13..4....0.11..2..3..4...10.11..8.13.14
%e A264494 .15..0.17..8..3....5..0.17.18..3...15.16..1.18.19...15..0..1.18..3
%e A264494 .20.28..6.19.24...16.21.12.23.24...10..5..6..7.24...20..5..6.19.24
%e A264494 .21.26.11.18.29...15.26.11.28.19...21.26.27.28.29...25.26.27.28.29
%e A264494 .30.31.16.33.34...30.31.32.33.34...30.31.32.17.34...30.31.16.17.34
%e A264494 .25.32.27.22.23...25.20.27.22.29...25.20.33.22.23...21.32.33.22.23
%Y A264494 Cf. A264490.
%K A264494 nonn
%O A264494 1,1
%A A264494 _R. H. Hardin_, Nov 14 2015