OFFSET
1,2
COMMENTS
Convert to decimal the binary numbers A300560, which represent the deep factorization of n: each factor prime(i)^e_i is replaced by the expression [i [e_i]], recursively for indices i and exponents e_i, and finally '[' and ']' are considered as binary digits 1 and 0.
The initial a(1) = 0 represents the empty string of binary digits.
All terms are multiples of 4, and some of a higher power of 2, which represent the trailing closing parentheses of the deep factorization. These factors of 2 can be removed without loss of information; then all terms (except for n = 1) are odd, and we can consider (x-1)/2. This more condensed version is A300563(n) = (a(n)/2^valuation(a(n),2) - 1)/2, with binary representation given in A300562(n).
LINKS
J. Awbrey, Riffs and Rotes, Selected Sequences, OEIS Wiki, Feb. 2010.
EXAMPLE
The first term a(1) = 0 represents, by convention, the empty factorization of the number 1.
2 = prime(1)^1 => (1(1)) => (()) => 1100_2 = 12 = a(2).
3 = prime(2)^1 => (2(1)) => ((())()) => 11100100_2 = 228 = a(3).
4 = prime(1)^2 => (1(2)) => (((()))) => 11110000_2 = 240 = a(4).
5 = prime(3)^1 => (3(1)) => (((())())()) => 111100100100_2 = 3876 = a(5).
6 = prime(1)^1*prime(2)^1 => (1(1))(2(1)) => (())((())()) => 110011100100_2 = 3300 = a(6).
7 = prime(4)^1 => (4(1)) => ((((())))()) => 111110000100_2 = 3972 = a(7).
8 = prime(1)^3 => (1(3)) => ((((())()))) => 111110010000_2 = 3984 = a(8), and so on.
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Mar 08 2018
STATUS
approved