what sequences most need extending?

[Jud McCranie]

At 05:08 PM 5/23/2005, N. J. A. Sloane wrote:

>Dear Seqfans,  I got email asking me to propose
>a sequence that a group of programmers could
>work on as a challenge.  The following
>constraints were suggested:
>
>
>
>1) It must be NP-complete
>2) It must be simple to describe
>3) It should not have been widely explored
>4) A solution must be easy to check (= it doesn't require a lot of
>computation)
>5) It has to be computed from N=8 to at most 64

There might not be that many that are known to be NP-complete but there are 
plenty marked "hard" that will fit the bill.  They could search for the 
"hard" keyword and find many sequences that fit the bill, other than 
NP-complete.