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.

A299991 Numbers n for which A243822(n) > A000005(n).

Original entry on oeis.org

30, 42, 60, 66, 70, 74, 78, 82, 84, 86, 90, 94, 98, 102, 106, 110, 114, 118, 120, 122, 126, 130, 132, 134, 138, 140, 142, 146, 150, 154, 156, 158, 162, 165, 166, 168, 170, 174, 178, 180, 182, 186, 190, 194, 195, 198, 202, 204, 206, 210, 214, 218, 220, 222, 226
Offset: 1

Views

Author

Michael De Vlieger, Feb 25 2018

Keywords

Comments

Composite numbers m have nondivisors k in the cototient such that k | n^e with e > 1. These k appear in row n of A272618 and are enumerated by A243822(n). These nondivisors k are a kind of "regular" number along with divisors d of n; both are listed in row n of A162306 and are together enumerated by A010846(n).
This sequence lists numbers that have more nondivisors k in the cototient of n than divisors d.
This sequence contains all n for which A299990(n) is positive.
The smallest odd term is 165.
For m >= 3, A002110(m) is in a(n).
For m >= 9, A244052(m) is in a(n).

Examples

			30 is the first term since it is the smallest number for which A243822(n) > A000005(n), alternatively, for which A010846(n) > 2*A000005(n).
		

Crossrefs

Programs

  • Mathematica
    Select[Range@ 226, Function[n, Count[Range[n], _?(PowerMod[n, Floor@ Log2@ n, #] == 0 &)] > 2 DivisorSigma[0, n]]]