A324113 a(n) = -1, 0 or +1 depending on whether A156552(n) is A000120-deficient, -perfect or -abundant: a(n) = sign(A324100(n)).

-1, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, -1, 1, -1, 1, -1, 1, -1

Offset

2

Comments

a(n) = -1 if A156552(n) is in A175524, 0 if it is in A175522 and +1 if it is in A175526.

Links

Antti Karttunen, Table of n, a(n) for n = 2..4473

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Formula

a(n) = sign(A324100(n)) = sign(A192895(A156552(n)).

Prog

(PARI) A324113(n) = sign(A324100(n)); \\ The rest of program given in A324100.

Crossrefs

Cf. A156552, A175522, A175524, A175526, A192895, A324100.

Cf. A324101, A324102 (positions of nonnegative and negative terms).

Sequence in context: A182394 A079054 A131695 * A105812 A134323 A060576

Adjacent sequences: A324110 A324111 A324112 * A324114 A324115 A324116

Keyword

sign

Author

Antti Karttunen, Feb 19 2019

Status

approved