login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339975 a(n) is the number of 0's minus the number of 1's among the first n terms of A337546. 2
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 (list; graph; refs; listen; history; text; internal format)
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 5 first terms of  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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 00:17 EDT 2021. Contains 345080 sequences. (Running on oeis4.)