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.

Showing 1-1 of 1 results.

A379496 a(n) = A019565(1+n) - A019565(A001065(n)), where A019565 is the base-2 exp-function, and A001065 is the sum of proper divisors of n.

Original entry on oeis.org

2, 4, 3, 4, 13, 15, 5, -16, 16, 35, 33, 59, 103, 189, -3, -188, 31, -44, 53, -55, 123, 225, 75, 89, 216, 451, 315, 385, 1153, 2037, 11, -2284, -171, 23, -5, -4160, 193, 225, 69, -247, 271, -1599, 453, 819, 1339, 2499, 141, -309, 422, 312, 605, 65, 2143, 4239, 979, 1985, 2673, 5993, 5003, 2275, 15013, 29991, -165
Offset: 1

Views

Author

Antti Karttunen, Jan 05 2025

Keywords

Crossrefs

Cf. also A379498.

Programs

  • PARI
    A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
    A379496(n) = (A019565(1+n) - A019565(sigma(n)-n));

Formula

a(n) = A019565(1+n) - A379495(n).
For even n, a(n) = 2*A019565(n) - A379495(n).
For n of the form 4k+1, a(n) = (3/2)*A019565(n) - A379495(n).
Showing 1-1 of 1 results.