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 A036389 #19 Feb 19 2021 10:40:49 %S A036389 0,0,1,4,12,30,69,150,317,659,1361,2784,5686,11557,23445,47472,95991, %T A036389 193891,391266,788979,1589856,3201863,6445059,12967425,26080302, %U A036389 52434693,105386552,211751544,425359720,854245385,1715204991 %N A036389 Number of (odd and even) split numbers (A036382) below 2^n. %C A036389 Equivalently, number of split numbers (A036382) with binary order (A029837) <= n. %C A036389 Partial sums of A036385. - _Sean A. Irvine_, Oct 29 2020 %e A036389 The 12 odd and even split numbers below 32 are as follows: 6, 10, 12, 14, 18, 20, 21, 22, 24, 26, 28, 30. %Y A036389 Cf. A029837 (ceiling(log_2(n))), A036382. %K A036389 nonn,more %O A036389 1,4 %A A036389 _Labos Elemer_ %E A036389 Definition rephrased by _M. F. Hasler_, Apr 24 2017 %E A036389 a(21)-a(31) from _Sean A. Irvine_, Oct 29 2020