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.

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

This page as a plain text file.
%I A264367 #4 Nov 12 2015 07:03:55
%S A264367 1,13,169,936,5184,33408,215296,1323792,8139609,50261301,310358689,
%T A264367 1916465345,11834176225,73043905820,450847788304,2783165854192,
%U A264367 17180991840016,106056375378580,654674355426025,4041262228505645
%N A264367 Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,0 0,2 1,0 or -1,-2.
%C A264367 Row 3 of A264364.
%H A264367 R. H. Hardin, <a href="/A264367/b264367.txt">Table of n, a(n) for n = 1..210</a>
%e A264367 Some solutions for n=4
%e A264367 ..7..1..0..3..4....7..1..0..3..4....0..8..9..3..2....7..1..0..3..4
%e A264367 ..5..6..2..8..9....5..6..2..8..9....5..1.14..6..4...12..6..2..8..9
%e A264367 .10.18.19.13.12...10.18.12.13.14...10.18..7.13.12....5.18.19.11.14
%e A264367 .15.11.17.16.14...15.11.17.16.19...15.11.17.16.19...10.16.15.13.17
%Y A264367 Cf. A264364.
%K A264367 nonn
%O A264367 1,2
%A A264367 _R. H. Hardin_, Nov 12 2015