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 A147568 #15 Dec 16 2018 06:40:48
%S A147568 3,5,11,13,35,37,43,45,131,133,139,141,163,165,171,173,515,517,523,
%T A147568 525,547,549,555,557,643,645,651,653,675,677,683,685,2051,2053,2059,
%U A147568 2061,2083,2085,2091,2093,2179,2181,2187,2189,2211,2213,2219,2221,2563,2565,2571
%N A147568 a(n) = 2*A000695(n)+3.
%C A147568 Every odd number m>=9 is a unique sum of the form a(k)+2a(l); moreover this sequence is the unique one with such property. In connection with A103151, note that there is no subsequence T of primes such that every odd number m>=9 is expressible as a unique sum of the form m=p+2q, where p and q are in T. One can prove that if one replaces 9 by any integer x_o>9, the statement remains true (see the Shevelev link).
%H A147568 Vladimir Shevelev, <a href="https://arxiv.org/abs/0811.0290">On Unique Additive Representations of Positive Integers and Some Close Problems</a>, arXiv:0811.0290 [math.NT], 2008.
%t A147568 (* b = A000695 *) b[n_] := If[n==0, 0, If[EvenQ[n], 4 b[n/2] , b[n-1]+1]];
%t A147568 a[n_] := 2 b[n] + 3; Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Dec 14 2018 *)
%o A147568 (PARI) a000695(n) = fromdigits(binary(n), 4);
%o A147568 a(n) = 2*a000695(n)+3; \\ _Michel Marcus_, Dec 13 2018
%Y A147568 Cf. A000695, A062880, A103151.
%K A147568 nonn
%O A147568 0,1
%A A147568 _Vladimir Shevelev_, Nov 07 2008
%E A147568 More terms from _Michel Marcus_, Dec 13 2018