login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229686 The negative number of minimum absolute value not obtainable from 1 in n steps using addition, multiplication, and subtraction. 1

%I #9 Sep 30 2013 12:57:41

%S -1,-2,-4,-9,-29,-85,-311,-1549,-9851,-74587,-956633

%N The negative number of minimum absolute value not obtainable from 1 in n steps using addition, multiplication, and subtraction.

%C This is similar to A141414 but applied to negative numbers. It is the greatest negative number that requires an n step SLP (Stright Line Program) to compute it.

%e For n=1 the value is -1 since -1 requires 2 steps SLP: 1,2,-1.

%e For n=2 the value is -2 since -2 requires 3 steps SLP: 1,2,3,-2.

%e For n=3 the value is -4 since -3 also requires only 3 steps but -4 requires 4: 1,2,4,5,-4.

%Y Cf. A141414, A216999, A214872.

%K sign,hard

%O 0,2

%A _Gil Dogon_, Sep 27 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 9 00:53 EDT 2024. Contains 374171 sequences. (Running on oeis4.)