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.

A309531 a(n) = Sum_{k=2..n} (-1)^k * A240236(n, k).

Original entry on oeis.org

1, 1, 0, 0, 2, 2, -3, 1, 5, 5, -2, -2, 4, 10, -6, -6, 1, 1, -8, 0, 10, 10, -16, -8, 4, 18, 7, 7, 13, 13, -19, -7, 9, 19, -11, -11, 7, 21, -15, -15, -5, -5, -20, 10, 32, 32, -36, -24, -1, 17, 0, 0, 18, 32, -14, 6, 34, 34, -23, -23, 7, 45, -29, -13, 5, 5, -16, 8, 30, 30, -66
Offset: 2

Views

Author

Seiichi Manyama, Aug 06 2019

Keywords

Examples

			a(2) = 1.
a(3) = 2 - 1 = 1.
a(4) = 1 - 2 + 1 = 0.
a(5) = 2 - 3 + 2 - 1 = 0.
a(6) = 2 - 2 + 3 - 2 + 1 = 2.
		

Crossrefs

Programs

  • PARI
    {a(n) = sum(k=2, n, (-1)^k*sumdigits(n, k))}

Formula

a(n) = a(n-1) if and only if n is an odd prime.