Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.
A065160
Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.
Terms
- a(0) =1a(1) =2a(2) =5a(3) =4a(4) =17a(5) =18a(6) =73a(7) =8a(8) =65a(9) =66a(10) =529a(11) =68a(12) =545a(13) =546a(14) =4369a(15) =16a(16) =257a(17) =258a(18) =4129a(19) =260a(20) =4161a(21) =4162a(22) =66593a(23) =264a(24) =4225a(25) =4226a(26) =67617a(27) =4228a(28) =67649a(29) =67650
External references
- oeis: A065160