A300560 - cp's OEIS frontend

A300560 Deep factorization of n, written in binary: replace each factor p^e with the expression [primepi(p) [ e ]], iterate on these numbers, finally replace '[' and ']' with '1' and '0'.

n	a(n)
1	0
2	1100
3	11100100
4	11110000
5	111100100100
6	110011100100
7	111110000100
8	111110010000
9	111001110000
10	1100111100100100
11	1111100100100100
12	1111000011100100
13	1110011100100100
14	1100111110000100
15	11100100111100100100
16	111111000000
17	1111110000100100
18	1100111001110000
19	1111110010000100

[0, 1100, 11100100, 11110000, 111100100100, 110011100100, 111110000100, 111110010000, 111001110000, 1100111100100100, 1111100100100100, 1111000011100100, 1110011100100100, 1100111110000100, 11100100111100100100, 111111000000, 1111110000100100, 1100111001110000, 1111110010000100]

cp's OEIS Frontend

A300560 Deep factorization of n, written in binary: replace each factor p^e with the expression [primepi(p) [ e ]], iterate on these numbers, finally replace '[' and ']' with '1' and '0'.

Table of values

List of values