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.

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

This page as a plain text file.
%I A263815 #8 Jun 02 2025 12:14:48
%S A263815 25001,6425985,1746531193,469723808009,126619013196417,
%T A263815 34115669220776257,9192934463267451648,2477107286160692307665,
%U A263815 667479079896424692364561,179858109547460186078311121,48464361871154130857566821761
%N A263815 Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0.
%C A263815 Column 5 of A263816
%H A263815 R. H. Hardin, <a href="/A263815/b263815.txt">Table of n, a(n) for n = 1..210</a>
%e A263815 Some solutions for n=1
%e A263815 ..6..3..0..2..4..5....6..2..1..4..3..5....0..3..4..1..2..5....6..2..0..4..5.11
%e A263815 ..7..1.10..8.11..9....0..8..9..7.11.10....7..6..8..9.11.10....7..1.10..3..8..9
%Y A263815 Cf. A263816
%K A263815 nonn
%O A263815 1,1
%A A263815 _R. H. Hardin_, Oct 27 2015