|
| |
|
|
A153013
|
|
Starting with input 0, find the binary value of the input. Then interpret resulting string of 1s and 0s as prime-based numbers, as follows: 0s are separators, uninterrupted strings of 1s are interpreted from right to left as exponents of the prime numbers. For example, 101 is interpreted as 3^1 *2^1 = 6. 1110011 is interpreted as 5^3 * 2^2 = 500. Output is returned as input for the next number in sequence.
|
|
0
| |
|
|
0, 1, 2, 3, 4, 5, 6, 9, 10, 15, 16, 11, 12, 25, 50, 147, 220, 6125, 1968750
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|