Search: id:A118275 Results 1-1 of 1 results found. %I A118275 %S A118275 1,1,2,1,4,1,6,3,6,4,2,6,5,6 %N 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.). %C A118275 Sequence A118274 is the string of terms of this sequence written in binary and concatenated. %H A118275 Leroy Quet, Home Page (listed in lieu of email address) %e A118275 The string of concatenated binary representations of a(0) through a(7) is %e A118275 11101100111011. Now a(7)= 3, which is 11 in binary. '11' occurs 6 times in the string (with, in this case, some binary digits in the string being used more than once). (The six '11's occur at {with position 1 on the left} positions 1, 2, 5, 9, 10 and 13.) So a(8) = 6. (And '1,1,0' is appended to the end of sequence A118274.) %Y A118275 Cf. A118274. %Y A118275 Sequence in context: A074919 A138009 A131755 this_sequence A146938 A147418 A146386 %Y A118275 Adjacent sequences: A118272 A118273 A118274 this_sequence A118276 A118277 A118278 %K A118275 easy,more,nonn %O A118275 0,3 %A A118275 Leroy Quet Apr 21 2006 Search completed in 0.001 seconds