90892

Appears in sequences

• Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a paw, where the paw is the graph on 4 vertices, 3 of which form a triangle and the 4th vertex is adjacent to exactly one of those 3.at n=10A079572
• Positive integers k such that 13^k == 9 (mod k).at n=18A116636