cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

-1, -2, -4, -9, -29, -85, -311, -1549, -9851, -74587, -956633
Offset: 0

Views

Author

Gil Dogon, Sep 27 2013

Keywords

Comments

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.

Examples

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

Crossrefs