cp's OEIS Frontend

A010846(n) = A000005(n) + A243822(n).

Successive terms in this sequence represent increasing differences A243822(n) - A000005(n).

A000079 = records in -1 * A299990, since A243822(p^e)=0 for e>=0, n = 2^k sets records in A000005(n). The corresponding records are in A000027.

A010846(n) = A000005(n) + A243822(n).

A000079 = records in -1 * A299990, since A243822(p^e)=0 for e>=0, n = 2^k sets records in A000005(n). The corresponding records are in A000027.

Number of terms less than 10^k with 0 <= k <= 7: {0, 1, 6, 18, 32, 51, 68, 96}.

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).

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 A045763(n).

Primes p have 2 divisors {1, p}; these two numbers constitute the cototient of p: there are no nondivisors in the cototient.

Prime powers p^i have (i + 1) divisors; all smaller powers of the same prime p, i.e., p^j with 0 <= j <= i, also divide p^i. These numbers constitute the cototient of p^i; there are no nondivisors in the cototient.

Therefore, we can ignore cases where n has no nondivisors in the cototient, since they obviously have more divisors than nondivisors therein.

This sequence lists (composite) numbers n with omega(n) > 1 that have fewer nondivisors k in the cototient of n than divisors d.

The smallest odd term is 15.

The number m = 1001 is the smallest term with A001221(m) = 3. No term less than 36,000,000 has A001221(m) > 3.

The following terms m are the smallest to have A001222(m) = {2, 3, 4, ...}: {6, 12, 24, 48, 96, 192, 384, 1152, 2304, 4608, 13824, 27648, 55296, 110592, 331776, 663552, 1327104, 3981312, 7962624, 15925248, ...}

Number of terms less than 10^k for 0 <= k <= 7: {0, 2, 44, 319, 2171, 15545, 119469, 969749}.

Indices of zeros in A299990, i.e., A010846(n) - 2*A000005(n) = 0.

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 A045763(n). Divisors of n are listed in row n of A027750.

This sequence lists numbers that have an equal number of nondivisors k in the cototient of n as divisors d.

The smallest odd term is 105.