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-2 of 2 results.

A193512 a(n) = Sum of odd divisors of Omega(n), a(1) = 0.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 4, 4, 1, 4, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 4, 4, 1, 1, 6, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 4, 1, 4, 1, 4, 1, 6, 1, 1, 4, 4, 1, 4, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 4, 4, 1, 1, 4, 1, 1, 4
Offset: 1

Views

Author

Michel Lagneau, Jul 29 2011

Keywords

Comments

Omega = A001222 is the number of prime divisors of the argument, counted with multiplicity.
a(1) = 0 by convention.

Examples

			a(8) = 4 because Omega(8) = 3 and the sum of the 2 odd divisors {1, 3} is 4.
		

Crossrefs

Programs

Formula

a(1) = 0, for n > 1, a(n) = A000593(A001222(n)).
a(n) + A193511(n) = A290080(n). - Antti Karttunen, Jul 23 2017

Extensions

Description clarified, more terms from Antti Karttunen, Jul 23 2017

A290080 a(1) = 0; for n > 1, a(n) = sigma(bigomega(n)).

Original entry on oeis.org

0, 1, 1, 3, 1, 3, 1, 4, 3, 3, 1, 4, 1, 3, 3, 7, 1, 4, 1, 4, 3, 3, 1, 7, 3, 3, 4, 4, 1, 4, 1, 6, 3, 3, 3, 7, 1, 3, 3, 7, 1, 4, 1, 4, 4, 3, 1, 6, 3, 4, 3, 4, 1, 7, 3, 7, 3, 3, 1, 7, 1, 3, 4, 12, 3, 4, 1, 4, 3, 4, 1, 6, 1, 3, 4, 4, 3, 4, 1, 6, 7, 3, 1, 7, 3, 3, 3, 7, 1, 7, 3, 4, 3, 3, 3, 12, 1, 4, 4, 7, 1, 4, 1, 7, 4
Offset: 1

Views

Author

Antti Karttunen, Jul 23 2017

Keywords

Crossrefs

Differs from A289617 for the first time at n=32, where a(n) = 6, while A289617(32) = 8.

Programs

Formula

a(1) = 0; for n > 1, a(n) = A000203(A001222(n)).
a(n) = A193511(n) + A193512(n).
Showing 1-2 of 2 results.