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:

- A001263, Narayana numbers count unlabeled ordered rooted trees on n nodes having k leaves, proof
- A323875, Number of labeled graphs on n nodes with two connected components
- A323876, Number of labeled graphs on n nodes with three connected components
- A323877, Number of labeled graphs on n nodes with four connected components
- A143543, Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.
- A056292, Necklace colorings with four swappable colors
- A002076, Necklace colorings with three swappable colors
- A306194, Non-isomorphic colorings of the edges of a cube using at most n colors under rotational symmetries and permutations of the colors
- A000009, Number of partitions into distinct parts
- A001429, Number of n-node connected unicyclic unlabelled graphs
- A321244, Non-isomorphic proper colorings of the 3 X 3 grid graph using at most n colors under rotational and reflectional symmetries
- A304482, Number A(n,k) of n-element subsets of 1..kn whose elements sum to a multiple of n
- A316093, Non-isomorphic colorings of the cube under rotations, using at most N colors on the faces and M colors on the vertices
- A244581, Multisets of multisets corresponding to integer partitions lambda, drawn from |lambda| symbols, where the sizes of the multisets are given by the elements of lambda as is the total number of occurrences of each symbol
- A294198, Labeled trees with at least one node of degree two
- 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
- A279514 Number of terms in the cycle index Z(S_n X S_n) of the Cartesian product of the symmetric group S_n with itself that contain q cycles, where 1 <= q <= n*n
- A277840 Number of finite automata with n states, n input symbols and two output symbols
- A277073 Number of n-node labeled graphs with two endpoints
- A274056 Number of unrooted labeled trees on 2n nodes with node degree either one or three