long sequence, or too many short ones? Znam's problem

[Alonso Del Arte]

I've been wondering a similar issue.

As a matter of school spirit, I've wanted to add to the OEIS the
solutions to Znám's problem for k = 8, which were calculated by
Professor Lawrence Brenton and grad Ana Vasiliu here at Wayne State
University.

In a way, these are already "listed" in A075461, not just because of
our faith that the numbers exist even if they're not displayed, but
also because many of the solutions for k = 8 share initial terms with
those for lower k (as you know, 2, 3, 7, 43, ...; 2, 3, 7, 47, ...)

But with 744 terms total, the eighth term of each solution often being
longer than a phone number with area code, the only other option would
be to send in 93 sequences of 8 terms each, which even with an
ergonomic keyboard is probably a prescription for carpal tunnel
syndrome.

Alonso


On 5/16/05, Joshua Zucker <joshua.zucker at gmail.com> wrote:
> Based on a sequence puzzle from another website, I recently submitted
> http://www.research.att.com/projects/OEIS?Anum=A107082
> 
> My question is whether, since truncating this at 4 lines is leaving
> out a lot of terms, I ought to submit the 256 finite sequences -- many
> of which are very short, with only 2 or 3 or 4 terms! -- that this
> sequence discusses. Or alternatively, a question for Neil: in cases
> like these, would it be possible to have some mechanism for including
> the whole sequence somewhere?
> 
> Maybe the best solution is to write it up on a web page and add the
> link to that page in the sequence.  But I wanted to get all the terms
> in the OEIS, not just an auxiliary web page, so that superseeker would
> have a chance of solving any sequence puzzle of this type (difference
> sequence consists of the digits 1 through 9 in order, perhaps
> concatenated).
> 
> Thanks for any advice,
> --Joshua Zucker
> 
>