OFFSET
1,1
COMMENTS
With a different offset, partial sums of A022934, cf. formula.
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
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
R. Israel, Re: Differences between linear recurrence, program(s) and b-file, SeqFan list, Apr 11 2019
FORMULA
a(n) = 2*floor((n+2)/log(2)) - 4.
a(n) = 2*Sum_{k=2,..,n+1} A022934(k).
MAPLE
seq(2*floor((n+2)/log(2))-4, n=1..100); # Robert Israel, Apr 11 2019
MATHEMATICA
Table[2 Floor[(n + 2)/Log[2]] - 4, {n, 1, 70}] (* Vincenzo Librandi, Jul 06 2015 *)
PROG
(PARI) vector( 80, n, 2*floor((n+2)/log(2)) - 4) \\ Michel Marcus, Jul 06 2015
(PARI) A166986(n)=(n+2)\log(2)*2-4 \\ M. F. Hasler, Apr 11 2019, corrected by Charles R Greathouse IV, Oct 19 2022
(Magma) [2*Floor((n+2)/Log(2)) - 4: n in [1..80]]; // Vincenzo Librandi, Jul 06 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Stephen Crowley, Oct 26 2009
STATUS
approved