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.

A375010 a(n) = prime(n-1) - floor((prime(n-2) + prime(n-1) + prime(n)) / 3).

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 0, 2, -1, 1, 1, 0, 0, 0, 2, -1, 1, 1, -1, 1, 0, 0, 2, 1, 0, 1, 0, -3, 4, 0, 2, -2, 3, -1, 0, 1, 0, 0, 2, -2, 3, 0, 1, -3, 0, 3, 1, 0, 0, 2, -2, 2, 0, 0, 2, -1, 1, 1, -2, -1, 4, 1, 0, -3, 3, -1, 3, 0, 0, 0, 1, 0, 1, 0, 0, 2, -1, 0, 3, -2
Offset: 3

Views

Author

Bill McEachen, Jul 27 2024

Keywords

Examples

			For n=500001 a(n) = 7368787 - floor((7368743 + 7368787 + 7368791)/3) = 14.
		

Programs

  • Mathematica
    seq[len_] := (#[[2]] - Floor[Total[#]/3]) & /@ Partition[Prime[Range[len]], 3, 1]; seq[100] (* Amiram Eldar, Jul 27 2024 *)