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.

A263681 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive decreases.

This page as a plain text file.
%I A263681 #4 Oct 23 2015 14:15:32
%S A263681 1,2,5,17,70,349,2017,11253,58743,286327,1331630,6077344,27523597,
%T A263681 126333667,587717372,2760990038,13033515692,61583867944,290639649211,
%U A263681 1368090247852,6426462715392,30151737816899,141417395713905
%N A263681 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive decreases.
%C A263681 Column 6 of A263683.
%H A263681 R. H. Hardin, <a href="/A263681/b263681.txt">Table of n, a(n) for n = 1..210</a>
%e A263681 Some solutions for n=7
%e A263681 ..1....4....1....3....3....2....1....2....0....0....5....0....0....3....2....2
%e A263681 ..0....5....6....6....5....6....0....5....5....2....6....1....1....1....6....0
%e A263681 ..5....0....4....0....6....1....3....0....1....5....1....3....6....5....3....1
%e A263681 ..6....1....5....2....0....4....2....1....4....6....3....4....4....0....5....6
%e A263681 ..2....6....2....4....1....3....4....3....6....3....0....6....5....6....1....3
%e A263681 ..3....2....3....1....2....5....5....4....2....4....2....2....2....2....4....4
%e A263681 ..4....3....0....5....4....0....6....6....3....1....4....5....3....4....0....5
%Y A263681 Cf. A263683.
%K A263681 nonn
%O A263681 1,2
%A A263681 _R. H. Hardin_, Oct 23 2015