Number of ways we can write [n] as the union of 2 sets of sizes i, j which intersect in exactly 2 elements (2 < i,j < n; i = j allowed).
A348257
Number of ways we can write [n] as the union of 2 sets of sizes i, j which intersect in exactly 2 elements (2 < i,j < n; i = j allowed).
Terms
- a(0) =6a(1) =30a(2) =105a(3) =315a(4) =868a(5) =2268a(6) =5715a(7) =14025a(8) =33726a(9) =79794a(10) =186277a(11) =429975a(12) =982920a(13) =2228088a(14) =5013351a(15) =11206485a(16) =24903490a(17) =55050030a(18) =121110297a(19) =265289475a(20) =578813676a(21) =1258290900a(22) =2726297275a(23) =5888802465a(24) =12683574918a(25) =27246198378a(26) =58384711245a(27) =124822486575a(28) =266287971856a(29) =566935682544
External references
- oeis: A348257