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 A166986 #34 Dec 23 2024 14:53:42
%S A166986 4,6,10,12,16,18,20,24,26,30,32,36,38,42,44,46,50,52,56,58,62,64,68,
%T A166986 70,72,76,78,82,84,88,90,94,96,98,102,104,108,110,114,116,120,122,124,
%U A166986 128,130,134,136,140,142,146,148,150,154,156,160,162,166,168,172,174,176
%N A166986 a(n) = 2*floor((n+2)/log(2)) - 4.
%C A166986 With a different offset, partial sums of A022934, cf. formula.
%C A166986 The first terms appear to satisfy a linear recurrence relation of order 10 (or higher if more terms are included), but this can be proved to be impossible, cf. R. Israel's post to the SeqFan list. - _M. F. Hasler_, Apr 11 2019
%H A166986 G. C. Greubel, <a href="/A166986/b166986.txt">Table of n, a(n) for n = 1..1000</a>
%H A166986 R. Israel, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2019-April/date.html">Re: Differences between linear recurrence, program(s) and b-file</a>, SeqFan list, Apr 11 2019
%F A166986 a(n) = 2*floor((n+2)/log(2)) - 4.
%F A166986 a(n) = 2*Sum_{k=2,..,n+1} A022934(k).
%p A166986 seq(2*floor((n+2)/log(2))-4, n=1..100); # _Robert Israel_, Apr 11 2019
%t A166986 Table[2 Floor[(n + 2)/Log[2]] - 4, {n, 1, 70}] (* _Vincenzo Librandi_, Jul 06 2015 *)
%o A166986 (PARI) vector( 80, n, 2*floor((n+2)/log(2)) - 4) \\ _Michel Marcus_, Jul 06 2015
%o A166986 (PARI) A166986(n)=(n+2)\log(2)*2-4 \\ _M. F. Hasler_, Apr 11 2019, corrected by _Charles R Greathouse IV_, Oct 19 2022
%o A166986 (Magma) [2*Floor((n+2)/Log(2)) - 4: n in [1..80]]; // _Vincenzo Librandi_, Jul 06 2015
%Y A166986 Cf. A022934.
%K A166986 easy,nonn
%O A166986 1,1
%A A166986 _Stephen Crowley_, Oct 26 2009