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

A202275 Differences between A074753 (number of integers k such that sigma(k) <= n) and A202276 (number of integers k <= n such that sigma(x) = k has no solution); sigma = A000203.

Original entry on oeis.org

1, 0, 1, 2, 1, 2, 3, 4, 3, 2, 1, 3, 4, 5, 6, 5, 4, 6, 5, 6, 5, 4, 3, 6, 5, 4, 3, 4, 3, 4, 6, 8, 7, 6, 5, 6, 5, 6, 7, 8, 7, 10, 9, 10, 9, 8, 7, 10, 9, 8, 7, 6, 5, 7, 6, 8, 9, 8, 7, 10, 9, 10, 11, 10, 9, 8, 7, 8, 7, 6, 5, 10, 9, 10, 9, 8, 7, 8, 7, 9, 8, 7, 6, 9
Offset: 1

Views

Author

Jaroslav Krizek, Dec 25 2011

Keywords

Comments

Conjectures: Max a(n) = 15 for n = 195, 403, 434. For n >= 687, a(n) < 0.
First term < 0: a(538) = -1.

Crossrefs

Formula

a(n) = A074753(n) - A202276(n).

A202277 Numbers m such that number of integers k such sigma(k) <= m (A074753) is equal to number of integers k <= m such that sigma(x) = k has no solution (A202276).

Original entry on oeis.org

2, 537, 639, 647, 653, 655, 657, 661, 663, 672, 674, 684, 686
Offset: 1

Views

Author

Jaroslav Krizek, Dec 25 2011

Keywords

Comments

Numbers m such that A074753(m) - A202276(m) = 0.
Numbers m such that A202275(m) = 0 (see graph of A202275).
Conjecture: sequence is finite with 13 terms.

Crossrefs

A175253 a(n) = characteristic function of numbers k such that A000203(m) = k has no solution for any m, where A000203(m) = sum of divisors of m.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1
Offset: 1

Views

Author

Jaroslav Krizek, Mar 14 2010

Keywords

Comments

a(n) = characteristic function of numbers from A007369(n). a(n) = 1 if A000203(m) not equal to n for any m, else 0. a(n) = 1 for such n that A054973(n) = 0. a(n) = 0 for such n that A054973(n) >= 1. a(n) + A175192(n) = A000012(n).

Crossrefs

Programs

  • Mathematica
    seq[max_] := Module[{t = Table[0, {max}]}, t[[Complement[Range[max], Table[ DivisorSigma[1, n], {n, 1, max}]]]] = 1; t]; seq[100] (* Amiram Eldar, Mar 22 2024 *)

Extensions

More terms from Jaroslav Krizek, Dec 25 2011.
Showing 1-3 of 3 results.