Intended for: July 31, 2012
Timetable
- First draft entered by Alonso del Arte on April 30, 2011 ✓
- Draft reviewed by Daniel Forgues on May 6, 2011 ✓
- Draft approved by Alonso del Arte on July 28, 2011 ✓
The line below marks the end of the <noinclude> ... </noinclude> section.
A173419: Length of shortest computation yielding
using
addition,
subtraction and
multiplication.
-
{ 0, 1, 2, 2, 3, 3, 4, 3, 3, 4, 4, 4, 5, ... }
So you start with
and then through successive
,
, or
operations for some
, you get to
. The fun is of course getting there in as few steps as possible.
Prime are not necessarily more difficult to get to than their neighbors:
29, for example, requires five operations, just as
28 and
30 do.