[seqfan] Re: Number names - a chain

Bob Selcoe rselcoe at entouchonline.net
Tue Mar 10 01:18:27 CET 2015


Hi Sean, Eric & Seqfans,

Sean - that's interesting; quite sure I couldn't do any better than 17! 
(definitely not without a program).

A variant on the puzzle could be how many letters in the longest chain given 
n words.  For example n=13 could start:

EIGHTY-SEVEN, FOUR, ELEVEN, THIRTY-FOUR, SEVEN...

adding 13 letters total to your chain, Eric.

Cheers,
Bob Selcoe

--------------------------------------------------
From: "Sean A. Irvine" <sairvin at gmail.com>
Sent: Monday, March 09, 2015 7:04 PM
To: "Sequence Fanatics Discussion list" <seqfan at list.seqfan.eu>
Subject: [seqfan] Re: Number names - a chain

> Still running, but I've found one of length 17 so far:
>
> 0, 6, 1, 30, 7, 2, 9, 4, 11, 50, 100, 56, 101, 60, 104, 66, 111
>
> You could make this a sequence by asking for the longest starting with
> n, although I suspect many starting values would give the same length.
>
>
> On 10 March 2015 at 12:42, Eric Angelini <Eric.Angelini at kntv.be> wrote:
>>
>> Hello SeqFans,
>> Is this the longest possible (English) such chain?
>> No integer shares a letter with its neighbours:
>>
>> EIGHT, FOUR, ELEVEN, TWO, SEVEN,
>> THIRTY, ONE, SIX, ZERO, FIFTY,
>> ONE HUNDRED, FIFTY-SIX,
>> ONE HUNDRED (AND) ONE.
>> ... 13 words. (I have 25 in French,
>> hope this is not old hat again)
>> Best,
>> É.
>>
>>
>> _______________________________________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
> 


More information about the SeqFan mailing list