User talk:Naohiro Nomoto

I ran across A064660, which you contributed back in 2002, while trying to gain deeper insight into a certain combinatorial problem. The sequence of partitions generated in the process you describe appears to match exactly a table which I generated in solving that problem, so that the solution to that problem is the Durfee square of the partition. I am therefore interested to know in what context you came across the construction, and whether you know of any material (published or unpublished) about it. Peter J. Taylor 22:20, 16 June 2014 (UTC)

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:55, 29 December 2015 (UTC)