A339975 a(n) is the number of 0's minus the number of 1's among the first n terms of A337546.

0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0

Offset

0,5

Comments

See A339976 for the positions of 0's.

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Rémy Sigrist, C program for A339975

Formula

a(n) = Sum_{k = 1..n} (-1)^A337546(n).

a(n) = n - 2*Sum_{k = 1..n} A337546(n).

Example

For n = 5, the first 5 terms of A337546 are 0, 1, 0, 0, 1, so a(5) = 3 - 2 = 1.

Prog

(C) See Links section.

Crossrefs

Cf. A294448, A337546, A339976.

Sequence in context: A099313 A316491 A097468 * A283144 A098381 A318463

Adjacent sequences: A339972 A339973 A339974 * A339976 A339977 A339978

Keyword

sign

Author

Rémy Sigrist, Dec 25 2020

Status

approved