For each value of <i>k</i>: The number of bits required to store the lower-triangle of the adjacency matrix for an undirected <i>k</i>-graphette; the number of such <i>k</i>-graphettes counting all isomorphs which is just 2^{<i>b</i>(<i>k</i>)}; the number of canonical <i>k</i>-graphettes (this will be the number of unique entries in the above lookup table [22], and up to <i>k</i> = 8, 14 bits is sufficient); and the total number of unique automorphism orbits (up to <i>k</i> = 8, 17 bits is sufficient) [27].

Note that up to k = 8, together the lookup table for canonical graphettes and their canonical orbits fits into 31 bits, allowing storage as a single 4-byte integer, with 1 bit to store whether the graphette is connected (i.e., also a graphlet). The suffixes K, M, G, T, P, and E represent exactly 210, 220, 230, 240, 250 and 260, respectively.