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.

User: Roberto Conti

Roberto Conti's wiki page.

Roberto Conti has authored 1 sequences.

A368899 Least integer which begins n consecutive integers with the same prime tower factorization tree.

Original entry on oeis.org

1, 2, 33, 19940, 136824, 630772, 30530822
Offset: 1

Author

Roberto Conti, Jan 09 2024

Keywords

Comments

The (unordered) prime tower tree for k having prime factorization k = Product p[i]^e[i] comprises a root vertex and beneath it child subtrees with tree numbers e[i].
a(n) is the smallest k such that A369015(k) = A369015(k+i) for 1 <= i < n.
a(n) <= A034173(n) since it demands equal exponents but here they only have to be isomorphic.

Examples

			For n=5, a(5) = 136824 = 2^3 * 3^1 * 5701^1 has tree structure
   136824
   / | \
  3  1  1
  |
  1
The structures of the 5 numbers 136824, ..., 136828 are isomorphic as rooted trees, for example
   136826
   / | \
  1  2  1
     |
     1
		

Crossrefs