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.

A322297 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 7).

This page as a plain text file.
%I A322297 #9 Dec 02 2018 18:31:56
%S A322297 1,1,1,1,1,1,1,2,16,128,800,4160,18944,78080,301160,1208066,6753606,
%T A322297 60823622,648980646,6581663766,60475366230,505780634070,3921237755958,
%U A322297 29226687666930,227116001463258,2092153010685722,24250743543656922,322040690042341562
%N A322297 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 7).
%H A322297 Alois P. Heinz, <a href="/A322297/b322297.txt">Table of n, a(n) for n = 0..526</a>
%Y A322297 Cf. A317111, A322251, A322262, A322276, A322298.
%K A322297 nonn
%O A322297 0,8
%A A322297 _Alois P. Heinz_, Dec 02 2018