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.

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

This page as a plain text file.
%I A264067 #12 Mar 26 2025 18:44:40
%S A264067 34,605,12100,239580,4745620,94000060,1861931060,36880691100,
%T A264067 730524027860,14470047586940,286619288597620,5677287244745820,
%U A264067 112454366267732500,2227469555002850620,44121191405337881780,873942149581465363740,17310839904533248019540,342889032579435158191100
%N A264067 Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,1 or 1,2.
%H A264067 R. H. Hardin, <a href="/A264067/b264067.txt">Table of n, a(n) for n = 1..210</a>
%F A264067 Empirical: a(n) = 19*a(n-1) +16*a(n-2) for n>3.
%F A264067 Empirical g.f.: x*(34 - 41*x + 61*x^2) / (1 - 19*x - 16*x^2). - _Colin Barker_, Jan 04 2019
%e A264067 Some solutions for n=3:
%e A264067 ..0..1..8..9..4....6..8..9..3..4....6..1..8..9..4....0..8..9..3..4
%e A264067 ..5..6.14..2..3...12..0.14..1..2...11..0..7..2..3....5..6.13..1..2
%e A264067 .16.17.12.13..7...16..5.18.13..7...10..5.18.19.14...17.11.19..7.14
%e A264067 .15.10.11.18.19...15.10.17.11.19...15.16.17.12.13...15.16.10.18.12
%Y A264067 Column 4 of A264071.
%K A264067 nonn
%O A264067 1,1
%A A264067 _R. H. Hardin_, Nov 02 2015