This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A330525 #9 Dec 18 2019 14:30:23 %S A330525 3,6,5,7,14,10,11,15,28,9,12,18,20,19,29,22,21,23,30,13,24,17,25,38, %T A330525 40,34,41,39,31,60,36,37,44,72,35,56,68,73,76,74,42,43,46,45,27,26,84, %U A330525 75,47,57,77,88,69,89,78,52,79,62,80,33,48,66,81,70,82,148 %N A330525 The binary representation of a(n) is the concatenation of that of A330524(n) and of A330524(n+1). %C A330525 Does this sequence contain every positive number except powers of 2? %H A330525 Rémy Sigrist, <a href="/A330525/b330525.txt">Table of n, a(n) for n = 1..10000</a> %F A330525 a(n) = A163621(A330524(n), A330524(n+1)). %o A330525 (PARI) s=0; v=1; for (n=1, 66, for (w=1, oo, if (!bittest(s, k=v*2^#binary(w)+w), print1 (k", "); s+=2^k; v=w; break))) %Y A330525 Cf. A163621, A330524. %K A330525 nonn,base %O A330525 1,1 %A A330525 _Rémy Sigrist_, Dec 17 2019