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 A307612 #12 Apr 19 2019 10:38:35 %S A307612 0,1,3,7,10,15,22,31,37,45,55,67,81,97,115,135,146,159,174,191,210, %T A307612 231,254,279,306,335,366,399,434,471,510,551,573,597,623,651,681,713, %U A307612 747,783,821,861,903,947,993,1041,1091,1143,1197,1253,1311,1371,1433,1497,1563,1631,1701,1773,1847 %N A307612 Partial sums of the permutation A307485: one odd, two even, four odd, eight even, etc. %H A307612 Orap Andrew a.k.a. Dalgerok, <a href="https://codeforces.com/contest/1151/problem/C">Codeforces Round #553 - C. Problem for Nazar</a>, on Codeforces.com, April 2019 %H A307612 <a href="/index/Per#IntegerPermutation">OEIS Index to sequences related to permutations of the integers</a>. %o A307612 (PARI) A307612(n,s=1,S,t,i=1)=until(n<i*=2,S+=(s-1+t=min(n+1-i,i))*t;s=s\/2+i);S %Y A307612 Cf. A307485 (the "1 odd, 2 even, 4 odd..." permutation), A307612 (partial sums thereof). %K A307612 nonn %O A307612 0,3 %A A307612 _M. F. Hasler_, Apr 18 2019