## Number Base Theory 101

Dozens Demigod
icarus
Dozens Demigod
Joined: Apr 11 2006, 12:29 PM
Summary of OEIS sequences
Summary of OEIS sequences associated with number theory of interest to number bases (m1n1f1g's "radicologists", or the OP's "number base theory 101") and digit maps:

(Map for 1 ≤ n ≤ 210)

Check out the map of all "digits" of "bases" less than 2310. Hearts ♥ attempt to key the relationships to this map.

Divisors:
A000005: Divisor counting function (σ_0(n), τ(n), d(n)).
A027750: Divisors of n.
A051731: Characteristic function of the divisors: 1 if m | n, 0 if not (useful in producing maps).
These show on the map as red pixels. The first pixel is always purple , as 1 is also a totative.
A002182: A000005 recordsetters. (Highly composite numbers).
A002183: Records in A000005.

Totatives:
A000010: Euler totient function (Totative counting function) (ϕ(n)).
A038566: Totatives of n (reduced residue system of n).
A054521: Characteristic function of the totatives: 1 if gcd(m, n) = 1, 0 if not.
These show on the map as light gray pixels. The first pixel is always purple , as 1 is also a divisor.
A000040: A000010 recordsetters (the primes).
A006093: Records in A000010 (primes p - 1).

Cototient: (non-totatives):
A051953: Cototient counting function.
A121998: Numbers m < n in the cototient of n.
A065385: A051953 recordsetters.
A065386: Records in A051953.
These show on the map as red, orange, or yellow pixels.

Nondivisors:
A049820: Nondivisor counting function.
A173540: Nondivisors of n.
These show on the map as orange, yellow, or light gray pixels.

Nondivisors in the cototient (numbers 1 < m < n "neutral" to n):
A045763: Neutral counting function.
A133995: Neutrals of n.
A304571: Characteristic function of nondivisors in the cototient of n.*
These show on the map as orange or yellow pixels.
A300859: A045763 recordsetters (highly neutral numbers)*
A300914: Records in A045763.*

Regulars (here, numbers 1 < m < n such that m divides n^e with e ≥ 0):
A010846: Regular counting function. ( rcf(n). We can calculate regulars m < lim for lim > n with rcf(n, lim) )
A162306: regulars of n.
A304569: Characteristic function of numbers m such that m | n^e with e ≥ 0.*
These show on the map as purple, red, or orange pixels.
A244052: A010846 recordsetters (Highly regular numbers).*
A244053: Records in A010846.*

Semidivisors (numbers 1 < m < n such that m divides n^e with e > 1):
A243822: Semidivisor counting function.*
A272618: Semidivisors of n.*
A304570: Characteristic function of numbers m such that m | n^e with e > 1.*
These show on the map as orange pixels.
A293555: A243822 recordsetters.*
A293556: Records in A243822.*

Semitotatives (nonregulars in the cototient of n):
A243823: Semitotative counting function.*
A272619: Semitotatives of n.*
A304572: Characteristic function of numbers m such that m divides no integer power of n yet gcd(m, n) > 1.*
These show on the map as yellow pixels.
A292867: A243823 recordsetters.*
A293868: Records in A243823.*

Richness of regulars of n: (richness meaning the least power n^e that regular m divides):
A279907: Richness of numbers in the range n.*
A280269: Richness of row n of A162306.*
A280274: Maximum richness in row n of A162306.*
A280363: Underlying formula for A280274.*
A294306: Population of values in row n of A280269.*

Study of "Highly Regular Numbers" A244052 (2016-7 "Turbulent Candidates" paper):
A288784: Necessary but insufficient condition.*
A288813: Turbulent candidates in A288784.*
A289171: "Depth"-"Distension" correlation for primorial(n).*
A3xxxxx: rcf(A002110(i), m) - A010846(m) for m in A288813 (Deficit of rcf(m) versus rcf(n, m)).

"Dominance" studies:
A294575: Semitotative-dominant numbers.*
A294576: Odd Semitotative-dominant numbers.*
A295221: Semitotative parity numbers.*
A295523: Nonprimes that have more semidivisors than semitotatives.*
A294492: Recordsetters for A045763(n)/n.*

Semidivisors vs. Divisors:
A299990: A243822(n) - A000005(n).*
A299991: Numbers that have more semidivisors than divisors.*
A299992: Numbers with more than 1 distinct prime divisor that have fewer semidivisors than divisors.*
A300155: Numbers that have equal numbers of semidivisors and divisors.*
A300156: A299990 recordsetters.*
A300157: Records in A299990.*

Semitotatives vs. Semidivisors:
A300858: A243823(n) - A243822(n). (A300858(p) for p prime = 0, for n = {6, 10, 12, 18, 30}, A300858(n) is negative.)
A300860: A300858 recordsetters.*
A300861: Records in A300858.*

Numbers m highly composite or superabundant, plotted as (x, y) = (m/p_ω(m)#, ω(m)).
A108602: ω(m)# for highly composite m.
A305025: ω(m)# for superabundant m.**
A301413: m/p_ω(m)# for highly composite m.
A305056: m/p_ω(m)# for superabundant m.**
A301416: m/p_ω(m)# for superior highly composite m.
A3xxxxx: m/p_ω(m)# for colossally abundant m.
A301414: Primitive values in A301413.
A3xxxxx: Primitive values of m/p_ω(m)# for superabundant m.
A3xxxxx: Primitive values of m/p_ω(m)# for superior highly composite m.
A3xxxxx: Primitive values of m/p_ω(m)# for colossally abundant m.
A301415: Number of primorials such that A301414(n) produces highly composite m.
A3xxxxx: Number of primorials such that primitive values of m/p_ω(m)# produces superabundant m.
A3xxxxx: Smallest k such that p_k# × A301414(n) produces highly composite m.
A3xxxxx: Largest k such that p_k# × A301414(n)  produces highly composite m.
A3xxxxx: Smallest k such that p_k# × primitive values of m/p_ω(m)# produces superabundant m.
A3xxxxx: Largest k such that p_k# × primitive values of m/p_ω(m)# produces superabundant m.

* sequences I'd added based on research presented here.
** current drafts.
*** prepared sequences with reserved A-numbers.

Updated 201807021519 CDT.

Dozens Demigod
icarus
Dozens Demigod
Joined: Apr 11 2006, 12:29 PM
Simplification of the notion of "neutral numbers".

In the past several weeks I have been examining record-setters of the counting functions of various entities. We have several counting functions, including
A000005 (divisor counting function) → A002182 highly composite numbers
A000010 (Euler totient function / totative counting function) (→ A000040 the prime numbers)
A010846 (regular counting function) → A244052 highly regular numbers
A045763 ("neutral" counting function: enumerates nondivisors in the cototient of n) → A300859 "highly neutral numbers"
A243822 (semidivisor counting function) → A293555 "highly semidivisible numbers"
A243823 (semitotative counting function) → A292867 "highly semitotient numbers"
In the course of doing this I have found a perhaps easier way of looking at neutral numbers.

Let n be a nonzero positive integer; we are concerned with the range R of integers 1 ≤ mn. We know within this range we have divisors d | n (see row n of A027750) and "totatives" t such that gcd(t, n) = 1 that appear in the reduced residue system (RRS) of n (see row n of A038566). Numbers m in R that are not coprime to n are said to occupy the "cototient" of n, while it is plain that numbers m in R that do not divide n are called "nondivisors" of n. Therefore we can construct a set of numbers m that are nondivisors in the cototient of n (see row n of A133995), which we will deem "neutral" to n or "the neutrals of n". These numbers have at least one prime divisor p that also divides n. We know that d | n^e with 0 ≤ e, an integer. We can find nondivisor m within R that also divide n^e with e > 1. Therefore we have two species of "regular" m, divisors d in A027750, and nondivisors m in row n of A162306 that also appear in A133995; these numbers, called "semidivisors", appear in row n of A272618. There are numbers m left in row n of A133995 that do not divide any integer power of n; these are "semitotatives" that appear in row n of A272619.

Therefore it is simple.

We have two species of nondivisors m in the cototient of composite n. The first are "semidivisors" m | n^e with e > 1 for n with more than 1 distinct prime divisor, and the last are "semitotatives" m that do not divide any integer power of n for composite n > 6. We can conflate the divisors and semidivisors as "regulars" m | n^e with e ≥ 0, and semitotatives and totatives as nondivisors m that do not divide any integer power of n.

Interestingly, A244052 (highly regular numbers) have primorials A002110 as a subset, along with integer multiples k < nextprime(p) of the primorials p# A060735, and not much correlation with highly composite A002182. The other terms that might be in A244052 appear in the "turbulent candidates" A288813, thus making A288784 the "necessary but insufficient condition" for A244052. Many of the terms in A293555 appear in A244052 and vice versa. Likewise regarding A300859 (highly neutral numbers), A293555 appears to be a subset, A244052 very closely correlated, and have a strong connection with A292867 (highly semitotient numbers). A002110 is a near-subset (all terms except the prime primorial 2). Check out my "pre-press" analysis of A300859 here, and a "concordance" of record-setters of these counting functions here. (The studies involved a dataset for A010846 the regular counting function for all integers 1 ≤ k ≤ 36,000,000, but A300859 can be computed in reasonable time to A002110(9) = 223,092,870.)

Once I "close the circle" on the sequences related to the several secondary entities within R, I plan to resume coding the Tour des Bases for its re-launch in its own website, to which we might then refer from this forum if it suits us.