A134156 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A134156

a(n) = 2*tau(n) - n, where tau(n) is the number of divisors of n (A000005).

1, 2, 1, 2, -1, 2, -3, 0, -3, -2, -7, 0, -9, -6, -7, -6, -13, -6, -15, -8, -13, -14, -19, -8, -19, -18, -19, -16, -25, -14, -27, -20, -25, -26, -27, -18, -33, -30, -31, -24, -37, -26, -39, -32, -33, -38, -43, -28, -43, -38, -43, -40, -49, -38, -47, -40, -49, -50, -55, -36

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

OFFSET

1,2

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = A000005(n) - A049820(n).

a(n) = n - 2*A049820(n). - Wesley Ivan Hurt, Feb 17 2024

PROG

(PARI) a(n) = {2*numdiv(n) - n} \\ Andrew Howroyd, Feb 02 2020

CROSSREFS

Cf. A000005 (tau), A049820.