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).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 8
5 32
6 132
7 702
8 4566
9 31670
10 237446
11 2010626
12 18782106
13 187594266
14 2009039346
15 23200862726
16 286250968646
17 3740867774726
18 51734894498790
19 756345994706634
20 11641318110171330
21 188004200777993570
22 3180713596572408650
23 56276908859288339822

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.