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.

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

This page as a plain text file.
%I A264267 #6 Nov 10 2015 11:30:25
%S A264267 25,256,3721,50625,707281,9834496,137007025,1908029761,26575846441,
%T A264267 370150560000,5155538077561,71807337114241,1000147266261025,
%U A264267 13930253758038016,194023406526536161,2702397428803850625
%N A264267 Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 1,0 or 1,2.
%C A264267 Column 3 of A264272.
%H A264267 R. H. Hardin, <a href="/A264267/b264267.txt">Table of n, a(n) for n = 1..210</a>
%F A264267 Empirical: a(n) = 14*a(n-1) +14*a(n-2) -210*a(n-3) +210*a(n-5) -14*a(n-6) -14*a(n-7) +a(n-8)
%e A264267 Some solutions for n=4
%e A264267 ..0..1..2..3....0..1..2..3....0..1..2..3....6..5..2..3....6..7..2..3
%e A264267 ..4..5.10..7....4..5..6.11...10..9..6..7....4..1..0..7....0..1.10.11
%e A264267 .12.15..6.11...14.15.10..7....8..5..4.15...12.13.14.11....4..9.14..5
%e A264267 ..8.19.14..9...12..9..8.19...16.13.18.11....8..9.10.19....8.19.18.15
%e A264267 .16.17.18.13...16.17.18.13...12.17.14.19...16.17.18.15...16.17.12.13
%Y A264267 Cf. A264272.
%K A264267 nonn
%O A264267 1,1
%A A264267 _R. H. Hardin_, Nov 10 2015