|
Search: id:A118275
|
|
|
| A118275 |
|
a(0) = 1. a(n) is the number of times the binary representation of a(n-1) appears in the concatenated string of the terms a(0) through a(n-1) written in binary. (The concatenated string is written from left to right and each binary integer is written so the most significant 1 is on the left.). |
|
+0
2
|
|
| 1, 1, 2, 1, 4, 1, 6, 3, 6, 4, 2, 6, 5, 6
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
