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.

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

Original entry on oeis.org

1, 1, 1, 2, 8, 32, 132, 702, 4566, 31670, 237446, 2010626, 18782106, 187594266, 2009039346, 23200862726, 286250968646, 3740867774726, 51734894498790, 756345994706634, 11641318110171330, 188004200777993570, 3180713596572408650, 56276908859288339822
Offset: 0

Views

Author

Alois P. Heinz, Nov 30 2018

Keywords

Crossrefs