Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S.
A066062
Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =6a(5) =10a(6) =20a(7) =37a(8) =73a(9) =139a(10) =275a(11) =533a(12) =1059a(13) =2075a(14) =4126a(15) =8134a(16) =16194a(17) =32058a(18) =63910a(19) =126932a(20) =253252a(21) =503933a(22) =1006056a(23) =2004838a(24) =4004124a(25) =7987149a(26) =15957964a(27) =31854676a(28) =63660327a(29) =127141415
External references
- oeis: A066062