86845

Appears in sequences

• Number of connected graphs with one cycle of length 4.at n=12A000368
• Number of snarks of order 2n with a maximum of 5 components in any 2-factor.at n=15A218887
• Numbers k such that phi(k, 2) = phi(k+1, 2), where phi(k, 2) = A002472(k).at n=17A301868
• a(n) is the smallest k such that A342068(k) = n.at n=28A342069