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.

A264879 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,-1 -2,0 or 1,1.

This page as a plain text file.
%I A264879 #4 Nov 27 2015 07:35:30
%S A264879 1,0,1,1,7,20,49,175,323,1085,2290,6489,15751,41749,105514,276079,
%T A264879 706396,1825615,4714184,12103729,31297188,80431077,207561706,
%U A264879 534335127,1377615603,3548250067,9145959294,23561913471,60719538527,156456169973
%N A264879 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,-1 -2,0 or 1,1.
%C A264879 Row 2 of A264878.
%H A264879 R. H. Hardin, <a href="/A264879/b264879.txt">Table of n, a(n) for n = 1..210</a>
%F A264879 Empirical: a(n) = 10*a(n-2) +6*a(n-3) -42*a(n-4) -40*a(n-5) +117*a(n-6) +143*a(n-7) -222*a(n-8) -266*a(n-9) +272*a(n-10) +266*a(n-11) -222*a(n-12) -143*a(n-13) +117*a(n-14) +40*a(n-15) -42*a(n-16) -6*a(n-17) +10*a(n-18) -a(n-20)
%e A264879 All solutions for n=4
%e A264879 .10..2.12..4.14
%e A264879 ..6..0..1..9..3
%e A264879 .11..5.13..7..8
%Y A264879 Cf. A264878.
%K A264879 nonn
%O A264879 1,5
%A A264879 _R. H. Hardin_, Nov 27 2015