User talk:Ray Chandler

I saw that you contributed to https://oeis.org/A056744 . I just want to ask do you have any more details about this problem? Any context, published, unpublished work? Long time ago I tried to solve a similar problem i.e. Smallest number which when written in binary contains the all binary strings with length n. The problem might be written as Smallest number which when written in binary contains the binary strings for the numbers 0..2^n-1. And I have these first six members: 2, 6, 92, 19832, 1179889136, 4833614029466089440 . Do you have any means to confirm the sixth member?--Kiro Velkovski 12:56, 29 December 2015 (UTC)