a(n) is the number of decompositions of F(n,1) into disjoint unions of F(j,k) and G(q,r) where F(j,k) is the set of numbers { i*k, 0 <= i <= j } and where G(q,r) is the set of numbers { (2*p-1)*r, 1 <= p <= q }.

A335631

a(n) is the number of decompositions of F(n,1) into disjoint unions of F(j,k) and G(q,r) where F(j,k) is the set of numbers { i*k, 0 <= i <= j } and where G(q,r) is the set of numbers { (2*p-1)*r, 1 <= p <= q }.

Terms

    a(0) =1a(1) =3a(2) =6a(3) =11a(4) =17a(5) =32a(6) =47a(7) =66a(8) =105a(9) =162a(10) =198a(11) =376a(12) =451a(13) =634a(14) =1131a(15) =1405a(16) =1576a(17) =2487a(18) =2761a(19) =4216a(20) =7499a(21) =9207a(22) =9931a(23) =19328a(24) =25621a(25) =30701a(26) =48795a(27) =67006a(28) =70841a(29) =122397

External references