The On-Line Encyclopedia of Integer Sequences (OEIS)

A057428 revision #25

A057428

Sign(-n): a(n) = 1 if -n > 0, = -1 if -n < 0, = 0 if n = 0.

0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

LINKS

Table of n, a(n) for n=0..83.

Index entries for linear recurrences with constant coefficients, signature (1).

FORMULA

G.f.: -x/(1-x).

a(n) = -A057427(n).

a(n) = -((n+2) mod (n+1)) for n >= 0. - Paolo P. Lava, Aug 28 2007

The g.f. f(x) = -x/(1-x) satisfies Babbage's functional equation f(f(x)) = x. - Nikolaos Pantelidis, Apr 13 2022

MATHEMATICA