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.

A383760 Irregular triangle read by rows in which the n-th row lists the exponential infinitary divisors of n.

Original entry on oeis.org

1, 2, 3, 2, 4, 5, 6, 7, 2, 8, 3, 9, 10, 11, 6, 12, 13, 14, 15, 2, 16, 17, 6, 18, 19, 10, 20, 21, 22, 23, 6, 24, 5, 25, 26, 3, 27, 14, 28, 29, 30, 31, 2, 32, 33, 34, 35, 6, 12, 18, 36, 37, 38, 39, 10, 40, 41, 42, 43, 22, 44, 15, 45, 46, 47, 6, 48, 7, 49, 10, 50
Offset: 1

Views

Author

Amiram Eldar, May 09 2025

Keywords

Comments

First differs from A322791 and A383761 at rows 16, 48, 80, 81, 112, 144, 162, ... and from A361255 at rows 256, 768, 1280, 1792, ... .
An exponential infinitary divisor d of a number n is a divisor d of n such that for every prime divisor p of n, the p-adic valuation of d is an infinitary divisor of the p-adic valuation of n.

Examples

			The first 10 rows are:
  1
  2
  3
  2, 4
  5
  6
  7
  2, 8
  3, 9
  10
		

Crossrefs

Cf. A307848 (row lengths), A361175 (row sums).

Programs

  • Mathematica
    infDivQ[n_, 1] = True; infDivQ[n_, d_] := n > 0 && d > 0 && BitAnd[IntegerExponent[n, First /@ (f = FactorInteger[d])], (e = Last /@ f)] == e;
    expInfDivQ[n_, d_] := Module[{f = FactorInteger[n]}, And @@ MapThread[infDivQ, {f[[;; , 2]], IntegerExponent[d, f[[;; , 1]]]}]]; expInfDivs[1] = {1};
    expInfDivs[n_] := Module[{d = Rest[Divisors[n]]}, Select[d, expInfDivQ[n, #] &]];
    Table[expInfDivs[n], {n, 1, 70}] // Flatten