A109301 a(n) = rhig(n) = rote height in gammas of n, where the "rote" corresponding to a positive integer n is a graph derived from the primes factorization of n, as illustrated in the comments.
0, 1, 2, 2, 3, 2, 3, 3, 2, 3, 4, 2, 3, 3, 3, 3, 4, 2, 4, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 5, 4, 4, 4, 3, 2, 3, 4, 3, 3, 4, 3, 4, 4, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 5, 3, 3, 5, 3, 3, 3, 4, 5, 4, 3, 3, 4, 3, 4, 3, 3, 4, 4, 3, 5, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 3, 3, 3, 5, 4, 4, 4, 4, 3, 4, 3
Offset: 1
Keywords
Examples
Writing (prime(i))^j as i:j, we have: 802701 = 2:2 8638:1 8638 = 1:1 4:1 113:1 113 = 30:1 30 = 1:1 2:1 3:1 4 = 1:2 3 = 2:1 2 = 1:1 1 = { } So rote(802701) is the graph: ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` o-o ` ` ` ` ` ` ` ` ` ` ` ` ` | ` ` ` ` ` ` ` ` ` ` ` ` o-o o-o ` ` ` ` ` ` ` ` ` ` ` | ` | ` ` ` ` ` ` ` ` o-o o-o o-o o-o ` ` ` ` ` ` ` | ` | ` | ` | ` ` ` ` ` ` ` o-o ` o===o===o-o ` ` ` ` ` ` | ` ` | ` ` ` ` ` o-o o-o o-o o-o ` o---------o | ` | ` | ` | ` ` | ` ` ` ` ` o---o ` o===o=====o---------o | ` ` ` | ` ` ` ` ` ` ` ` ` ` O=======O ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` Therefore rhig(802701) = 6.
Links
- J. Awbrey, Riffs and Rotes
Crossrefs
Formula
Writing (prime(i))^j as i:j, the prime factorization of a positive integer n can be written as n = prod_(k = 1 to m) i(k):j(k). This sets up the formula: rhig(n) = 1 + max_(k = 1 to m) {rhig(i(k)), rhig(j(k))}, where rhig(1) = 0.
Comments