cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A349229 a(n) = Sum_{k=1..n} (-1)^A001222(k)*(-1)^A001222(k+1).

Original entry on oeis.org

-1, 0, -1, -2, -3, -4, -3, -4, -3, -4, -3, -2, -3, -2, -1, -2, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 3, 4, 5, 4, 5, 6, 7, 6, 5, 6, 7, 6, 7, 8, 9, 10, 9, 8, 9, 8, 7, 6, 5, 6, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 4, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 4, 3, 4, 5, 4, 5, 4, 3, 4, 5, 6, 7, 6, 5, 6, 5, 4, 5, 6, 7, 6, 7, 8, 7, 6
Offset: 1

Views

Author

Benoit Cloitre, Nov 11 2021

Keywords

Comments

It is conjectured that a(n)=o(n).

Crossrefs

Cf. A001222.

Programs

  • Mathematica
    a[n_] := Sum[(-1)^(PrimeOmega[k] + PrimeOmega[k + 1]), {k, 1, n}]; Array[a, 100] (* Amiram Eldar, Nov 11 2021 *)
  • PARI
    a(n)=sum(k=1,n,(-1)^bigomega(k)*(-1)^bigomega(k+1))