reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
a(n) = Sum_{k = 1..n} (-1)^(n-k) gcd(k,n).
a(2*n2n+1) = 2*n 2n+ 1.
a(2*n2n) = A344372(n) = 2*n - A106475(n-1).
From Peter Bala, Dec 26 2023: (Start)
Conjectures:
1) for n >= 0, a(24*n+12) = 4*a(12*n+6) (checked up to n = 1000).
2) more generally, for n >= 0 and k >= 1, a((2^k)*(6*n+3)) = a(2^k)*a(12*n+6). (End)
a := n->sum((-1)^(n+k)*igcd(n, k), k = 1..n): seq(a(n), n = 1..50); # Peter Bala, Dec 26 2023
nonn,easy,changed
editing
approved
a(n) = Sum_{k = 1..n} (-1)^(n-k) gcd(k,n).
a(2n2*n+1) = 2n2*n + 1.
a(2n2*n) = A344372(n) = 2*n - A106475(n-1).
From Peter Bala, Dec 26 2023: (Start)
Conjectures:
1) for n >= 0, a(24*n+12) = 4*a(12*n+6) (checked up to n = 1000).
2) more generally, for n >= 0 and k >= 1, a((2^k)*(6*n+3)) = a(2^k)*a(12*n+6). (End)
a := n->sum((-1)^(n+k)*igcd(n, k), k = 1..n): seq(a(n), n = 1..50); # Peter Bala, Dec 26 2023
approved
editing
proposed
approved
editing
proposed