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 A086343 #17 Sep 23 2023 03:13:58
%S A086343 2,5,9,12,17,20,24,27,33,36,40,43,48,51,55,58,65,68,72,75,80,83,87,90,
%T A086343 96,99,103,106,111,114,118,121,129,132,136,139,144,147,151,154,160,
%U A086343 163,167,170,175,178,182,185,192,195,199,202,207,210,214,217,223,226,230
%N A086343 a(n) starts new run of consecutive values in A055938.
%C A086343 Shape sequence for A055938 is A001511
%F A086343 a(n) = 4n - 2 - A000120(n-1). - _Ralf Stephan_, Feb 23 2004
%e A086343 a(9) is 33 because A055938 begins
%e A086343 2
%e A086343 5 6
%e A086343 9
%e A086343 12 13 14
%e A086343 17
%e A086343 20 21
%e A086343 24
%e A086343 27 28 29 30
%e A086343 33
%e A086343 ...
%t A086343 t = Table[IntegerExponent[(2n)!, 2], {n, 0, 200}]; A055938 = Complement[ Range[t // Last], t]; First /@ Split[A055938, #2 == #1 + 1&] (* _Jean-François Alcover_, Nov 15 2016 *)
%o A086343 (PARI) A = vector(160); A[1] = 1; for (n = 2, 160, A[n] = n + A[n\2]; if (A[n] != 1 + A[n - 1], print1(A[n - 1] + 1, ", "))); \\ _David Wasserman_, Mar 03 2005
%Y A086343 Cf. A000120, A001511, A005187, A055938.
%K A086343 easy,nonn
%O A086343 1,1
%A A086343 _Alford Arnold_, Sep 03 2003
%E A086343 More terms from _David Wasserman_, Mar 03 2005