106424

Appears in sequences

• Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.at n=13A056156
• a(n) is the smallest error in trying to solve n^5 = x^5 + y^5: for each n from 2 on, find positive integers x and y, x <= y < n such that |n^5 - x^5 - y^5| is minimal and let a(n) = n^5 - x^5 - y^5. In case of a tie, choose the solution with smallest y.at n=22A369855