[seqfan] Re: New Printer's Errors from JMF

[Richard Mathar]

ea> From seqfan-bounces at list.seqfan.eu Thu Feb 19 12:34:22 2009
ea> Date: Thu, 19 Feb 2009 12:00:50 +0100
ea> From: "Eric Angelini" <Eric.Angelini at kntv.be>
ea> To: "Sequence Fanatics Discussion list" <seqfan at list.seqfan.eu>
ea> Subject: [seqfan]  New Printer's Errors from JMF
ea> 
ea> Hello SeqFans,
ea> Jean-Marc Falcoz has computed this list yesterday:
ea> http://odafin.chez.com/decompo.gif
ea> ... for itengers 0 -> 120000
ea> 
ea> Is this worth the OEIS? (I personally love them!)
ea> 
ea> The rule says:
ea> 
ea>     "Insert between each digit of N one of those symbols:
ea>       *
ea>       /
ea>       + 
ea>       -
ea>       ^
ea>      and see if N reproduces itself after computation"

This is ill-defined, because it does not specify the associative rules
(=implicit parentheses). These are part of any higher 
programming language, neither evident nor universal. For this reason
they need to be defined in detail.
Take the example of 2^3^4 (which some people think is well-defined,
though it isn't). See my comment in A145021.

Richard Mathar