OFFSET
3,2
COMMENTS
a(n) > 0 for n > 2 and it seems that a(n)/log(n) is bounded: a(n) < 4*log(n) for n sufficiently large. Does lim_{n->infinity} a(n)/log(n) exist?
LINKS
G. C. Greubel, Table of n, a(n) for n = 3..5000
MATHEMATICA
Table[4*Sum[KroneckerSymbol[j, j+1], {j, n}] - n, {n, 3, 80}] (* G. C. Greubel, Mar 17 2019 *)
PROG
(PARI) for(n=3, 100, print1(4*sum(i=1, n, kronecker(i, i+1))-n, ", "))
(Sage) [4*sum(kronecker_symbol(j+1, j) for j in (1..n))-n for n in (3..80)] # G. C. Greubel, Mar 17 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 14 2002
STATUS
approved