71450

Appears in sequences

• Number of simple unlabeled graphs on n nodes with exactly 4 connected components that are trees or cycles.at n=15A215984
• Sequence defined by a(1)=a(2)=1 and a(n) = gray(gray(a(n-1)) + gray(a(n-2))), with gray(m) = A003188(m).at n=33A265386