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.

A336498 Irregular triangle read by rows where T(n,k) is the number of divisors of n! with k prime factors, counted with multiplicity.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 4, 4, 3, 1, 1, 3, 5, 6, 6, 5, 3, 1, 1, 4, 8, 11, 12, 11, 8, 4, 1, 1, 4, 8, 11, 12, 12, 12, 12, 11, 8, 4, 1, 1, 4, 8, 12, 16, 19, 20, 20, 19, 16, 12, 8, 4, 1, 1, 4, 9, 15, 21, 26, 29, 30, 30, 29, 26, 21, 15, 9, 4, 1
Offset: 0

Views

Author

Gus Wiseman, Aug 03 2020

Keywords

Comments

Row n is row n! of A146291. Row lengths are A022559(n) + 1.

Examples

			Triangle begins:
  1
  1
  1  1
  1  2  1
  1  2  2  2  1
  1  3  4  4  3  1
  1  3  5  6  6  5  3  1
  1  4  8 11 12 11  8  4  1
  1  4  8 11 12 12 12 12 11  8  4  1
  1  4  8 12 16 19 20 20 19 16 12  8  4  1
Row n = 6 counts the following divisors:
  1  2   4   8  16   48  144  720
     3   6  12  24   72  240
     5   9  18  36   80  360
        10  20  40  120
        15  30  60  180
            45  90
Row n = 7 counts the following divisors:
  1  2   4    8   16   48   144   720  5040
     3   6   12   24   72   240  1008
     5   9   18   36   80   336  1680
     7  10   20   40  112   360  2520
        14   28   56  120   504
        15   30   60  168   560
        21   42   84  180   840
        35   45   90  252  1260
             63  126  280
             70  140  420
            105  210  630
                 315
		

Crossrefs

A000720 is column k = 1.
A008302 is the version for superprimorials.
A022559 gives row lengths minus one.
A027423 gives row sums.
A146291 is the generalization to non-factorials.
A336499 is the restriction to divisors in A130091.
A000142 lists factorial numbers.
A336415 counts uniform divisors of n!.

Programs

  • Mathematica
    Table[Length[Select[Divisors[n!],PrimeOmega[#]==k&]],{n,0,10},{k,0,PrimeOmega[n!]}]