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.

A317176 Number of chains of factorizations of n into factors > 1, ordered by refinement, starting with the prime factorization of n and ending with the maximum factorization (n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 6, 1, 3, 1, 3, 1, 1, 1, 11, 1, 1, 2, 3, 1, 4, 1, 18, 1, 1, 1, 15, 1, 1, 1, 11, 1, 4, 1, 3, 3, 1, 1, 49, 1, 3, 1, 3, 1, 11, 1, 11, 1, 1, 1, 21, 1, 1, 3, 74, 1, 4, 1, 3, 1, 4, 1, 78, 1, 1, 3, 3, 1, 4, 1, 49, 6, 1, 1
Offset: 1

Views

Author

Gus Wiseman, Jul 23 2018

Keywords

Comments

If x and y are factorizations of the same integer and it is possible to produce x by further factoring the factors of y, flattening, and sorting, then x <= y.

Examples

			The a(24) = 11 chains:
  (2*2*2*3) < (24)
  (2*2*2*3) < (2*12)  < (24)
  (2*2*2*3) < (3*8)   < (24)
  (2*2*2*3) < (4*6)   < (24)
  (2*2*2*3) < (2*2*6) < (24)
  (2*2*2*3) < (2*3*4) < (24)
  (2*2*2*3) < (2*2*6) < (2*12) < (24)
  (2*2*2*3) < (2*2*6) < (4*6)  < (24)
  (2*2*2*3) < (2*3*4) < (2*12) < (24)
  (2*2*2*3) < (2*3*4) < (3*8)  < (24)
  (2*2*2*3) < (2*3*4) < (4*6)  < (24)
		

Crossrefs

Formula

a(prime^n) = A213427(n).