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.

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

This page as a plain text file.
%I A264271 #6 Nov 10 2015 11:32:01
%S A264271 1156,160000,53290000,13954224384,4035639032100,1138084297605025,
%T A264271 324302970384650401,92186952472695083584,26232276993922103173281,
%U A264271 7462849422249980275347009,2123325373891488033889110724
%N A264271 Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 1,0 or 1,2.
%C A264271 Column 7 of A264272.
%H A264271 R. H. Hardin, <a href="/A264271/b264271.txt">Table of n, a(n) for n = 1..109</a>
%e A264271 Some solutions for n=2
%e A264271 ..0..1..2.11.14..5..6..7....0.11.10..3.12..5..6..7....0.11..2..3.14..5..6..7
%e A264271 .16.19.10.21.12..3..4.15...16..1..2.19.22.13..4.23....8..9.10..1..4.13.22.15
%e A264271 ..8.17.18..9.20.13.22.23....8.17.18..9.20.21.14.15...16.17.18.19.20.21.12.23
%Y A264271 Cf. A264272.
%K A264271 nonn
%O A264271 1,1
%A A264271 _R. H. Hardin_, Nov 10 2015