

A160856


a(1)=1. a(n) = the smallest integer > a(n1) such that a(n) written in binary contains binary n as a substring, and such that (for n>=2) each value a(k)a(k1), for 2<=k<=n, is unique.


1



1, 4, 6, 12, 20, 24, 29, 40, 50, 74, 86, 99, 106, 115, 143, 160, 196, 210, 230, 276, 298, 342, 367, 385, 400, 416, 435, 456, 479, 505, 543, 576, 644, 674, 711, 740, 805, 844, 871, 928, 978, 1066, 1111, 1196, 1243, 1326, 1374, 1408, 1457, 1508, 1587, 1640
(list;
graph;
refs;
listen;
history;
text;
internal format)




