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.

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

This page as a plain text file.
%I A322276 #8 Dec 02 2018 08:50:59
%S A322276 1,1,1,1,1,2,12,72,352,1472,5756,26336,180116,1577006,13720566,
%T A322276 109776526,829240726,6488348726,59134377126,640605185526,
%U A322276 7502207070150,87309498759810,989782736128170,11277397727184650,136523328121058170,1817775858886701082
%N A322276 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 5).
%H A322276 Alois P. Heinz, <a href="/A322276/b322276.txt">Table of n, a(n) for n = 0..501</a>
%Y A322276 Cf. A317111, A322251, A322262.
%K A322276 nonn
%O A322276 0,6
%A A322276 _Alois P. Heinz_, Dec 01 2018