This site is supported by donations to The OEIS Foundation.

# User:Marko Riedel

From OeisWiki

B.Sc. Computer Science from UBC 1994, M.Sc. Computer Science from University of Toronto 1996.

Some sequences that I contributed / modified:

- A299104, A class of boolean functions under permutation / complementation of inputs, complementation of outputs
- A294198, Labeled trees with at least one node of degree two
- A298637, Generalized Catalan numbers (well-formed parentheses in words)
- A296143, Rows of beads under reflections and color swaps
- A294791, Colordings of the torus under rotational symmetry and swappable colors
- A292553, Number of rooted unlabeled trees on n nodes where each node has at most 8 children
- A007138, Number of unlabeled bicolored bipartite graphs on 2n nodes having n nodes of each color with no edges between vertices of the same color and allowing the color classes to be interchanged
- A284664, Number of proper colorings of the 2n-gon with 2 instances of each of n colors under rotational symmetry
- A283755, Number of non-isomorphic unlabeled connected graphs with loops on n nodes and with k edges
- A283153, Number of set partitions of unique elements from an n X 4 matrix where elements from the same row may not be in the same partition
- A281582, Number of rolls of a die with n sides that maximizes the average ratio of highest number of occurrences of a face value to lowest number