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 A233388 #25 Aug 29 2020 06:53:14 %S A233388 11,19,35,47,59,67,79,91,107,115,131,143,155,171,179,191,203,211,227, %T A233388 239,251,259,271,283,299,307,319,331,339,355,367,379,395,403,419,431, %U A233388 443,451,463,475,491,499,515,527,539,555,563,575,587,595 %N A233388 Odious numbers that are the sum of 2 consecutive odious numbers. %C A233388 Composites in this sequence: 35, 91, 115, 143, 155, 171, 203, 259, 299, 319, 229, 366, 395, 403, 451, 475, 515, 527, 539, 555, 575, 595,... %C A233388 (a(n + 1) - a(n))/4 are 2, 4, 3, 3, 2, 3, 3, 4, 2, 4, 3, 3, 4, 2, 3, 3, 2, 4, 3, 3, 2, 3, 3, 4, 2, 3, 3, 2, 4, 3, 3, 4, 2, 4, 3, 3, 2, 3,... %H A233388 Amiram Eldar, <a href="/A233388/b233388.txt">Table of n, a(n) for n = 1..10000</a> %e A233388 11 is in this sequence because 11 = A000069(6) and 11 = 4 + 7 where 4 = A000069(3) and 7 = A000069(4). %e A233388 19 is in this sequence because 19 = A000069(10) and 19 = 8 + 11 where 8 = A000069(5) and 11 = A000069(6). %t A233388 odQ[n_] := OddQ @ DigitCount[n, 2, 1]; Select[Plus @@@ Partition[Select[Range[300] , odQ], 2, 1], odQ] (* _Amiram Eldar_, Aug 29 2020 *) %Y A233388 Cf. A000069, A227930, A131323, A234431. %K A233388 nonn,easy %O A233388 1,1 %A A233388 _Gerasimov Sergey_, Dec 08 2013