Self-describing the digits
eric.angelini
does someone have the time/patience/skills
to answer the last remark, bottom of page:
http://www.cetteadressecomportecinquantesignes.com/DigitPosition.htm
Thanks,
É.
Philippe 92
Hi,
After a few trials (and attempts to understand the obscure
statements of the sequences ;-)
I got a S'1 sequence :
1,3,10,6,11,7,21,13,15,17,19,101,24,100,29,102,34,103,39,104,44,...
Note the 'backward' index, at a(6) = 7, indexing a '1' before it !
so that the a(5) = 11 has been choosen ... because this *next*
a(6) = 7 works !
That is when choosing the 11, we have to anticipate and find what
are the possible *next* terms.
Because of this, I was not able to write a *simple* program.
The above sequence was done by hand, and miracles do happen.
For instance I reached a(41) = 91 which describes its own 1 !
(and is smaller than the next free digit index = 92)
Regards
--
Philippe C., mail : chephip, with domain free.fr
site : http://mathafou.free.fr/ (mathematical recreations)
eric.angelini
> sequence was done by hand, and miracles do happen.
... Hello Philippe,
many, many thanks for your efforts !
But I have the same pb : I work "by hand" as you do !
I'm looking for a pgm where you could turn the variable 'k'
into zero, one, two, three... nine -- and get the required
seq...
Best,
É.
Philippe 92
Hi,
For information, this question has also been asked on fr.sci.maths
and "zwim" has written a program in C.
For the lurkers here :
<http://cjoint.com/data/lziF7iw5kl.htm>
Regards.