This site is supported by donations to The OEIS Foundation.

# User:Michael De Vlieger

I specialize in Wolfram code (Mathematica 12), visualization, bfiles, and run citations for NJAS. Registered architect and lover of integer number bases. Joined OEIS in June 2014. Mathematica user since 2008. Contributed about 5500 Mathematica programs to OEIS and enjoy helping program sequences.

## Some Visualizations

I've produced Mathematica visuals (sometimes mildly edited by photo-editor) of certain sequences. These are recent samples.

• Plot of terms ${\displaystyle m}$ in A325237 at ${\displaystyle (x,y)=(\pi (gpf(m))),\phi (m)/m)}$.
• Plot of terms ${\displaystyle m}$ in A325236 at ${\displaystyle (x,y)=(\pi (gpf(m))),\phi (m)/m)}$.
• Chart depicting prime power decomposition of A324581 vs. A002182.
• Compare A059894 (blue) with A307544 (red); coincident points (green).
• Graph of squarefree ${\displaystyle m}$ at ${\displaystyle (x,y)=(\pi (gpf(m))),\phi (m)/m)}$.
• Compare A307113 (blue) with A307327 (red).
• Graph.
• Graph of A306237${\displaystyle n}$ at ${\displaystyle (x,y)=(\pi (gpf(m))),\phi (m)/m)}$.
• Chart showing recursively self-conjugate partitions corresponding to ${\displaystyle n}$ in A323034.
• Expanded chart immediately above.
• Plot of terms of A323034 (black) in A321223(n) (color) for ${\displaystyle n\leq 65536}$.
• Chart depicting recursively self-conjugate partitions with side length ${\displaystyle n}$ for numbers ${\displaystyle m}$ in A322457.
• Plot of ${\displaystyle 1\leq k\leq 1200inrows[itex]1\leq n\leq 34}$ of A322457, also relating A190900.
• Chart showing recursively self-conjugate partitions of ${\displaystyle m}$ based on Durfee square of side length ${\displaystyle n}$.
• Chart of recursively self-conjugate partitions for ${\displaystyle 1\leq n\leq 150}$.
• Color-coded graph of A321223 showing relation ${\displaystyle n(\mod 3).}$.
• Graph of highly composite and superabundant numbers.
• Graph of 779,674 HCNs ${\displaystyle m}$ according to ${\displaystyle p\#,m/p\#}$ where ${\displaystyle p\#}$ is the largest primorial dividing ${\displaystyle m}$.

## Original Sequences (120)

Sequences I've written relate to regular numbers ${\displaystyle k|n^{\epsilon }with\epsilon \geq 0}$, the Euler totient function, nondivisors in the cototient of ${\displaystyle n}$, numbers neither coprime to ${\displaystyle n}$ nor regular, recursively self-conjugate partitions, highly composite and superabundant numbers, and methods of encoding prime decomposition.

• A325237: Squarefree ${\displaystyle k}$ such that ${\displaystyle {\frac {1}{2}}-\phi (k)/k}$ is positive and minimal for ${\displaystyle k}$ with ${\displaystyle gpf(k)=prime(n)}$.
• A325236: Squarefree ${\displaystyle k}$ such that ${\displaystyle \phi (k)/k-{\frac {1}{2}}}$ is positive and minimal for ${\displaystyle k}$ with ${\displaystyle gpf(k)=prime(n)}$.
• A307544: Binary encoding of A307540: ${\displaystyle T(n,k)=A087207(A307540(n,k))}$.
• A307540: Irregular triangle ${\displaystyle T(n,k)}$ such that squarefree ${\displaystyle m}$ with ${\displaystyle gpf(m)=prime(n)}$ in each row are arranged according to increasing values of ${\displaystyle \phi (k)/k}$.
• A306237: Primorial A002110(n)/A002110(n - 1).
• A307327: Number of superabundant numbers (${\displaystyle m}$ in A004394) in the interval ${\displaystyle p_{k}\#\leq m, where ${\displaystyle p_{i}\#=A002110(i)}$. (Analogous to A307113).
• A307322: Irregular triangle where row ${\displaystyle n}$ is a list of indices in A002110 with multiplicity whose product is ${\displaystyle A004394(n)}$. (Analogous to A306737.)
• A307107: ${\displaystyle a(n)=A025487(n)/A247451(n)}$.
• A307133: ${\displaystyle T(n,m)=}$ number of ${\displaystyle k\leq A002110(n}$ such that ${\displaystyle A001222(k)=m}$, where ${\displaystyle k}$ is a term in A025487.
• A307113: Number of highly composite numbers (${\displaystyle m}$ in A002182) in the interval ${\displaystyle p_{k}\#\leq m, where ${\displaystyle p_{i}\#=A002110(i)}$.
• A307056: Row ${\displaystyle n}$ = digits of ${\displaystyle A025487(n)}$ in primorial base.
• A306802: Position of highly composite numbers in the sequence of products of primorials. (Analogous to A293635.)
• A306737: Irregular triangle where row ${\displaystyle n}$ is a list of indices in A002110 with multiplicity whose product is ${\displaystyle A002182(n)}$.
• A323035: Records in A321223.
• A323034: Where records occur in A321223.
• A322457: Irregular triangle: Row ${\displaystyle n}$ contains numbers ${\displaystyle k}$ that have recursively symmetrical partitions having Durfee square with side length ${\displaystyle n}$.
• A322156: Irregular triangle where row ${\displaystyle n}$ includes all decreasing sequences ${\displaystyle S=\{k_{0}=n,k_{1},k_{2},\ldots ,k_{m}\}}$ in reverse lexical order such that the sum of subsequent terms ${\displaystyle k_{j}}$ for all ${\displaystyle i does not exceed any ${\displaystyle k_{i}}$.
• A321223: ${\displaystyle a(n)}$ is the number of recursively self-conjugate partitions of ${\displaystyle n}$.
• A305056: ${\displaystyle a(n)=A004394(n)/A002110(A001221(A004394(n)))}$. (For superabundant ${\displaystyle m}$, ${\displaystyle a(n)=m/p_{\omega (m)}\#}$).
• A305025: ${\displaystyle a(n)=A001221(A004394(n))=\omega (m)}$ where ${\displaystyle m}$ is superabundant.
• A304886: Irregular triangle where row ${\displaystyle n}$ contains indices ${\displaystyle k}$ where the product of ${\displaystyle A002110(k)=A025487(n)}$.
• A304235: Colossally abundant numbers that are highly composite, but not superior highly composite.
• A304234: Superior highly composite numbers that are superabundant but not colossally abundant.
• A301415: Numbers ${\displaystyle k}$ in A301413 such that ${\displaystyle k\times A002110(m)}$ is in A002201.
• A301414: Numbers ${\displaystyle k}$ in A301413 such that ${\displaystyle k\times A002110(m)}$ is in A002182.
• A301413: ${\displaystyle a(n)=A002182(n)/A002110(A108602(n))}$. (For highly composite ${\displaystyle m}$, ${\displaystyle a(n)=m/p_{\omega (m)}\#}$).
• A301893 Numbers ${\displaystyle m}$ that set records for the ratio ${\displaystyle A010846(m)/A000005(m)}$. This is the ratio of the regular counting function and the divisor counting function, where ${\displaystyle k|n^{e}withe\geq 0}$, integers, is regular to ${\displaystyle n}$ and counted when ${\displaystyle k\leq n}$.
• A301892 ${\displaystyle a(n)=A010846(A002182(n))}$. Number of regular ${\displaystyle k|m^{e}withe\geq 0,k\leq m}$ for highly composite ${\displaystyle m}$.
• A300914: Records in A045763.
• A300861: Records in A300858.
• A300860: Indices of records in A300858.
• A300859: Where records occur in A045763. Highly Neutral Numbers.
• A300858: a(n) = A243823(n) − A243822(n).
• A300157: Records in A299990.
• A300156: Indices of records in A299990.
• A300155: Numbers ${\displaystyle n}$ for which ${\displaystyle A243822(n)=A000005(n)}$ (i.e., ${\displaystyle \xi _{d}(n)=\tau (n)}$).
• A299992: Composite ${\displaystyle n}$ with ${\displaystyle \omega (n)>1}$ for which ${\displaystyle A243822(n).
• A299991: Numbers ${\displaystyle n}$ for which ${\displaystyle A243822(n)>A000005(n)}$ (i.e., ${\displaystyle \xi _{d}(n)>\tau (n)}$).
• A299990: a(n) = A243822(n) − A000005(n) = ${\displaystyle \xi _{d}(n)-\tau (n)}$.
• A294168: Irregular triangle read by rows in which row ${\displaystyle n}$ contains significant digits after the radix point for unit fractions ${\displaystyle {\frac {1}{n}}}$ expanded in factorial base.
• A295523: Nonprime numbers ${\displaystyle n}$ such that ${\displaystyle A243822(n)\geq A243823(n)}$, i.e., ${\displaystyle \xi _{d}(n)\geq \xi _{t}(n)}$.
• A295221: Numbers ${\displaystyle k}$ such that ${\displaystyle 2\times A243823(k)=k}$.
• A294576: Odd ${\displaystyle m}$ such that ${\displaystyle 2\times A243823(m)>m}$.
• A294575: Numbers ${\displaystyle m}$ such that ${\displaystyle 2\times A243823(m)>m}$.
• A294492: Numbers ${\displaystyle n}$ that set records for the ratio ${\displaystyle A045763(n)/n}$. (i.e., the ratio ${\displaystyle \xi (n)/n}$).
• A294306: Irregular triangle ${\displaystyle T(n,m)}$ = total number of each value ${\displaystyle k}$ in row ${\displaystyle n}$ of A280269.
• A293556: Records in A243822.
• A293555: Indices of records in A243822.
• A292868: Records in A243823.
• A292867: Indices of records in A243823.
• A292393: Base-${\displaystyle n}$ digit ${\displaystyle k}$ involved in anomalous cancellation in the proper fraction ${\displaystyle A292288(n)/A292289(n)}$.
• A292289: Smallest denominator of a proper fraction that has a nontrivial anomalous cancellation in base ${\displaystyle b}$.
• A292288: Numerators of smallest denominator of a proper fraction that has a nontrivial anomalous cancellation in base ${\displaystyle b}$.
• A291928: Positions of records in A218320.
• A291927: Records transform of A218320.
• A291834: Positions of records of A252665.
• A291833: Records transform of A252665.
• A291213: Start from the singleton set ${\displaystyle S=\{n\}}$, and unless 1 is already a member of ${\displaystyle S}$, generate on each iteration a new set where each odd number ${\displaystyle k}$ is replaced by ${\displaystyle 3k+1}$, and each even number ${\displaystyle k}$ is replaced by ${\displaystyle 3k+1}$ and ${\displaystyle {\frac {k}{2}}}$. ${\displaystyle a(n)}$ is the total size of the set from the singleton through after the first iteration which has produced 1 as a member, inclusive.
• A289172: Irregular triangle read by rows: row ${\displaystyle n}$ lists terms ${\displaystyle m}$ of ${\displaystyle A038566(n)}$ such that ${\displaystyle \omega (m)=A051265(n)}$, with ${\displaystyle a(1)=1}$.
• A289171: Irregular triangle ${\displaystyle T(n,k)}$ read by rows with ${\displaystyle 1\leq k\leq n}$: ${\displaystyle T(n,1)}$ = A020900(nk + 1) − (nk + 1) and T(n, k) = max(0, T(n − 1, k − 1) − 1) otherwise.
• A288813: Irregular triangle read by rows: ${\displaystyle T(m,k)}$ is the list of squarefree numbers A002110(m) < t < 2 A002110(m + 1) such that ${\displaystyle \omega (t)=m}$.
• A288784: Irregular triangle read by rows: ${\displaystyle T(n,m)}$ is the list of numbers k × A002110(n) ≤ k × t < (k + 1)A002110(n) such that ${\displaystyle \omega (k\times t)=n}$, with ${\displaystyle 1\leq k.
• A287692: Triangle read by rows: ${\displaystyle T(n,k)}$ is the greatest difference between prime factors among squarefree numbers A002110(n) ≤ m ≤ (A002110(n + 1) − 1) such that ${\displaystyle \omega (m)=n}$ and ${\displaystyle m}$ is divisible by A002110(k).
• A287484: Triangle ${\displaystyle T(n,k)}$: number of squarefree numbers A002110(n) ≤ m ≤ (A002110(n + 1) − 1) such that ${\displaystyle \omega (m)=n}$ and ${\displaystyle m}$ is divisible by A002110(k).
• A287483: Squarefree numbers A002110(n) ≤ m ≤ (A002110(n + 1) − 1) such that ${\displaystyle \omega (k)=n}$.
• A287352: Irregular triangle ${\displaystyle T(n,k)=A112798(n,1)}$ followed by first differences of ${\displaystyle A112798(n)}$.
• A287010: Triangle ${\displaystyle T(n,m)}$: ${\displaystyle \lfloor (\log p_{n}\#)/(\log prime(m))\rfloor }$.
• A286424: Number of partitions of ${\displaystyle p_{n}\#}$ into parts ${\displaystyle (q,k)}$ both coprime to ${\displaystyle p_{n}\#}$, with ${\displaystyle q}$ prime and ${\displaystyle k}$ nonprime, where ${\displaystyle p_{n}\#=A002110(n)}$.
• A286300: Square root of smallest square formed from ${\displaystyle n}$ by incorporating all the digits of ${\displaystyle n}$ in a new decimal number.
• A285905: ${\displaystyle a(n)=A275768(A002110(n))}$.
• A285904: Partial row products of table A027746, prime factors with repetition, reversed.
• A285788: Irregular triangle ${\displaystyle T(n,m)}$: nonprime ${\displaystyle 1\leq k\leq n}$ such that ${\displaystyle \gcd(n,k)=1}$.
• A285769: (Product of distinct prime factors)^(Product of prime exponents).
• A284061: Triangle read by rows: ${\displaystyle T(n,k)=\pi (p_{k}\times p_{(n+1)})}$.
• A283866: Multiplicities of prime factors of A243103(n).
• A280363: ${\displaystyle a(n)=\lfloor \log _{p}n\rfloor withe=A020639(n)}$, the least prime factor of ${\displaystyle n}$.
• A280274: ${\displaystyle a(n)=}$ maximum value in row ${\displaystyle n}$ of A279907 (Also, maximum value in row ${\displaystyle n}$ of A280269).
• A280269: Irregular triangle ${\displaystyle T(n,k)}$ read by rows: least ${\displaystyle \rho }$ such that ${\displaystyle r|n^{\rho }}$ applied to terms ${\displaystyle r}$ in row ${\displaystyle n}$ of A162306.
• A279907: Triangle read by rows: ${\displaystyle T(n,k)}$ = smallest power of ${\displaystyle n}$ that is divisible by ${\displaystyle k}$, or ${\displaystyle -1}$ if no such power exists.
• A277071: Numbers ${\displaystyle n}$ for which ${\displaystyle A277070(n)}$ does not equal ${\displaystyle A237442(n)}$.
• A277070: Row length of ${\displaystyle A276380(n)}$.
• A277045: Irregular triangle ${\displaystyle T(n,k)}$ read by rows giving the number of partitions of length ${\displaystyle k}$ such that all of the members of the partition are distinct and in A003586.
• A276380: Irregular triangle where row ${\displaystyle n}$ contains terms ${\displaystyle k}$ of the partition of ${\displaystyle n}$ produced by greedy algorithm such that all elements are in A003586.
• A276379: Write a 1 for each distinct prime divisor ${\displaystyle p|n}$ in the (primepi(p) − 1)-th place, ignoring multiplicity.
• A275881: Numbers ${\displaystyle n}$ such that ${\displaystyle A010846(n)\geq n/2}$.
• A275280: Irregular triangle listing numbers ${\displaystyle m\leq n}$ such that ${\displaystyle m|n^{\epsilon }}$ with ${\displaystyle \epsilon \geq 0}$, in order of appearance in a matrix of products that arranges the power range of each ${\displaystyle p}$ along independent axes. (Algorithm of A010846, akin to A275055).
• A275055: Irregular triangle read by rows listing divisors ${\displaystyle d|n}$ in order of appearance in a matrix of products that arranges the power ranges of each ${\displaystyle p|n}$ along independent axes.
• A273258: Write the distinct prime divisors ${\displaystyle p|n}$ in place (primepi(p) − 1), ignoring multiplicity. Decode the resulting number after first reversing the code, ignoring any leading zeros.
• A272619: Irregular array read by rows: ${\displaystyle n}$-th row contains (in ascending order) the numbers ${\displaystyle 1\leq k such that at least one prime divisor ${\displaystyle p|k}$ also divides ${\displaystyle n}$ and at least one prime divisor ${\displaystyle q|k}$ is coprime to ${\displaystyle n}$.
• A272618: Irregular array read by rows: ${\displaystyle n}$-th row contains (in ascending order) numbers ${\displaystyle k such that ${\displaystyle k|n^{\epsilon }}$ with ${\displaystyle \epsilon >1}$.
• A262115: Digits of the base-${\displaystyle b}$ expansion of ${\displaystyle {\frac {1}{7}}}$.
• A262114: Digits of the base-${\displaystyle b}$ expansion of ${\displaystyle {\frac {1}{5}}}$.
• A256577: Raise decimal digit k to the ${\displaystyle \epsilon }$ power, where ${\displaystyle 10^{\epsilon }}$ is the place value.
• A254336: Powers of 10 written in base 60, concatenating the decimal values of sexagesimal digits.
• A254335: Powers of 5 written in base 60, concatenating the decimal values of sexagesimal digits.
• A254334: Powers of 3 written in base 60, concatenating the decimal values of sexagesimal digits.
• A250089: 5-smooth numbers written in base 60, concatenating the decimal values of sexagesimal digits.
• A250073: Powers of 2 written in base 60, concatenating the decimal values of sexagesimal digits.
• A243103: Product of ${\displaystyle n}$-regular numbers ${\displaystyle m\leq n}$ such that ${\displaystyle m|n^{\epsilon }}$ with ${\displaystyle \epsilon \geq 0}$.
• A242028: Numbers ${\displaystyle k}$ such that the least common multiple of the anti-divisors of ${\displaystyle k}$ is less than ${\displaystyle k}$.
• A241557: Numbers ${\displaystyle k}$ that do not have prime anti-divisors.
• A241556: Number of prime anti-divisors ${\displaystyle m}$ of ${\displaystyle n}$.
• A241419: Number of numbers ${\displaystyle m\leq n}$ that have one prime divisor ${\displaystyle p>{\sqrt {n}}}$ such that ${\displaystyle p|m}$.
• A245500: Concatenation of multiplicities of prime divisors of highly composite numbers ${\displaystyle A002182(n)}$.
• A244974: (Regular Sum Function) Sum of numbers ${\displaystyle m\leq n}$ such that ${\displaystyle m|n^{\epsilon }}$ for ${\displaystyle \epsilon \geq 0}$.
• A244053: Records in A010846.
• A244052: Recordsetters in A010846 (Highly Regular Numbers).
• A243823: Number of ${\displaystyle 1\leq k such that at least one prime divisor ${\displaystyle p|k}$ also divides ${\displaystyle n}$ and at least one prime divisor ${\displaystyle q|k}$ is coprime to ${\displaystyle n}$. (Semitotative Counting Function ${\displaystyle \xi _{t}(n)}$).
• A243822: Number of ${\displaystyle k\leq n}$ such that ${\displaystyle k|n^{\epsilon }}$ for ${\displaystyle \epsilon >1}$. (Semidivisor Counting Function ${\displaystyle \xi _{d}(n)}$).

## Handy Sequences

• A067255 Exponents e of ${\displaystyle p_{n}^{e}}$ written in the n-th place, abbreviated MN(n).
• A287352 "π-code" (pi-code), first differences of exponents of the prime divisors p arranged in order of magnitude of p from least to greatest. Abbreviated PC(n).
• A027746 The prime factors of n with multiplicity.
• A027748 The distinct prime factors of n.
• A001221 (little) ω(n) = number of distinct prime factors of n
• A001222 (big) Ω(n) = number of distinct prime factors of n counting multiplicity.
• A020639 Least prime divisor of n.
• A006530 Greatest prime divisor of n.
• A002110 the primorials, products ${\displaystyle p_{n}\#}$ of the smallest n primes.
• A060735 ${\displaystyle k\times p_{n}\#}$ with ${\displaystyle 1\leq k\leq p_{(n+1)}}$.
• A007947 squarefree root of n: largest squarefree number k | n.
• A025487 products of primorials (least integer of each prime signature).
• A124010 prime signature of n.
• A280363 floor(logp n}, with p the least prime that divides n.

## Number Bases

I've been fascinated with number bases since fifth grade. Because I've been afflicted with this fascination for 36 years, I know a lot about them. It has made me an "odd duck" among creatives, but also very efficient in my early career, conducting field measurements in US Customary measure rendered "metric" by using mixed radix arithmetic for onsite verification. This fascination is mellowing into a sober love of number theory.

Check out my multiplication tables for each base between 2 and 60 inclusive (8 Mb PDF) [1]. Recently these tables were generated with Mathematica so they are absolutely correct. (Please tell me if they are not and I will make them right). They use argam numerals for "transdecimal" bases, i.e., those bases b > 10. An adaptation of these charts is downloaded hundreds of times a month on another website.

"Argam numerals" I invented between 1983 and 2008 (first 60 numerals - PDF: [2], first 360 - JPG: [3]).

I wrote an article for ACM Inroads in 2012: "Exploring number bases as tools" [4].

Map of the number-theoretical qualities of numbers m <= n of bases n: [5]. I am making this map into a poster. It visually illustrates numbers m that divide n, that are coprime to n, that are regular but do not divide n, etc.

My favorite bases are 12, 60, and 120 and am pretty fluent in them in that order.

I am writing Mathematica code for an automatically generated website that regards integer number bases. This is the "Number Base" project; I've written the number theory engine and register. It should be complete in 2018.

## My Work

My company website is vincico.com[6] with examples of my "day job" work: modeling construction worksites. Since it's all digitally modeled, the work is sometimes surprisingly intertwined in number theory (spacings, divisions of spans, etc.) The work typically comes together with little upfront information, do-or-die deadlines 2-3 weeks ahead of notification, and rapidly evolving directives. The goal is usually to win a construction bid or to inform user groups of work on site. It often requires "filling in missing pieces" under urgent deadline pressure, and this is where I attempt to use highly divisible numbers that mesh with construction standard modules (often 4, 7, 12, 16, 48, 120, etc. inches) present and particular to the job to shorten development time. I am looking to further automate the digital modeling process of worksites - this is a move shared by several of us in the industry. One day I hope to use Wolfram language in the models.