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.

A082899 a(n) = A082893(n)-A000040(n), that is difference of n-th prime and number closest to it and divisible by n.

This page as a plain text file.
%I A082899 #4 Oct 15 2013 22:31:57
%S A082899 0,1,1,1,-1,-1,-3,-3,4,1,2,-1,-2,-1,-2,-5,-8,-7,9,9,-10,9,9,7,3,3,5,5,
%T A082899 7,7,-3,-3,-5,-3,-9,-7,-9,-11,-11,-13,-15,-13,-19,-17,-17,-15,-23,17,
%U A082899 18,21,22,21,24,19,18,17,16,19,18,19,22,17,8,9,12,13,4,3,-2,1,2,1,-2,-3,-4,-3,-4,-7,-6,-9,-14,-11,-16,-13,-14,-13,-14
%N A082899 a(n) = A082893(n)-A000040(n), that is difference of n-th prime and number closest to it and divisible by n.
%C A082899 n=9:p(9)=23 is between 18 and 27, closer to 27, so a(9)=27-23=+4.
%F A082899 a(n)=p[n]-n*floor[(floor(n/2)+p[n])/n], where p[n] is the n-th prime.
%t A082899 Table[Prime[n]-n*Floor[(Floor[n/2]+Prime[n])/n], {n, 1, 100}]
%Y A082899 Cf. A082893-A082901.
%K A082899 sign
%O A082899 1,7
%A A082899 _Labos Elemer_, Apr 22 2003