User:Caleb Stanford

Starting in Fall 2023, I am an assistant professor of computer science at the University of California, Davis.

Prior to that, I got a PhD in computer science from the University of Pennsylvania (2022) and an ScB in math and computer science from Brown University (2016).

For more information or to contact me, visit my website.

Published OEIS Sequences

- A260506: Number of signed permutations of length n that are sortable to the identity permutation by some sequence of cdr (context-directed reversal) and cds (context-directed swap) moves.

- A260509: Number of graphs on labeled vertices {x, y, 1, 2, ..., n}, such that there is a partition of the vertices into V_1 and V_2 with x in V_1, y in V_2, every v in V_1 adjacent to an even number of vertices in V_2, and every v in V_2 adjacent to an even number of vertices in V_1.

- A260511: Number of signed permutations of length n that are sortable to the identity permutation by some sequence of cdr (context-directed reversal) moves.

- A328261: Number of labeled prime graphs on n nodes, i.e., graphs with no nontrivial modules when calculating the modular decomposition.

- A340318: Minimum size of a partial order that contains all partial orders of size n.

- A362014: Number of distinct lines passing through exactly two points in a triangular grid of side n.

- A368809: Number of 4 X n binary arrays with a path of adjacent 1's from top row to bottom row using only left, right, and downward steps.

- A369892: Array read by antidiagonals: T(m, n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row using only left, right, and downward steps.