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.

A177599 Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up.

This page as a plain text file.
%I A177599 #21 Mar 12 2021 19:06:07
%S A177599 1,1,20,1680,347279,145417911,108103451700,130235191847880,
%T A177599 237916352264650149,626620767478218488341,2286998940761680215812180,
%U A177599 11203494211631147331264432480,71758642346800717617629677669619,587889139521679290927189491977855371
%N A177599 Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up.
%H A177599 Mingjia Yang and Doron Zeilberger, <a href="https://arxiv.org/abs/1805.06077">Increasing Consecutive Patterns in Words</a>, arXiv:1805.06077 [math.CO], 2018.
%H A177599 Mingjia Yang, <a href="https://doi.org/10.7282/t3-d9z1-aw94">An experimental walk in patterns, partitions, and words</a>, Ph. D. Dissertation, Rutgers University (2020).
%Y A177599 Cf. A014606.
%K A177599 nonn
%O A177599 0,3
%A A177599 _R. H. Hardin_, May 10 2010
%E A177599 a(10) from _Alois P. Heinz_, Nov 01 2013
%E A177599 a(11)-a(13) from _Alois P. Heinz_, Aug 08 2018