A382716 a(n) = n - A382715(n).

1, 1, 4, 1, 1, 9, 1, 1, -4, 1, 1, 1, 25, -4, 1, 1, 1, 36, -1, -1, -4, -1, 4, -4, 49, 4, 1, 1, -1, -1, -1, 64, 4, 1, 1, 1, 1, 1, 1, 1, 1, 81, 1, 1, 1, 1, 1, 1, 1, 1, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -9, 4, 1, 1, 1, 1, 1, 1, 1, 196, -1, -4, -1, -1, 4, -9

Offset: 1

Author

N. J. A. Sloane, Apr 09 2025

Keywords

• sign

Comments

Assuming that every integer appears in A377901, a(n) gives an indication of how difficult it was for the positive integer n to appear there.

(The definition of A377091 implies that |a(n)| is a square.)

Links

• N. J. A. Sloane, Table of n, a(n) for n = 1..10059

Crossrefs

Cf. A377091, A382715.

For RECORDS, see A382717, A382718, A379789.