Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.
A065159
Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.
Terms
- a(0) =0a(1) =1a(2) =4a(3) =15a(4) =16a(5) =85a(6) =108a(7) =511a(8) =64a(9) =585a(10) =660a(11) =5819a(12) =816a(13) =7085a(14) =7644a(15) =65535a(16) =256a(17) =4369a(18) =4644a(19) =78451a(20) =5200a(21) =87381a(22) =91564a(23) =1531639a(24) =6336a(25) =105625a(26) =109876a(27) =1825659a(28) =118384a(29) =1961821
External references
- oeis: A065159