The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A274423 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A274423

Let s(n,j) be Sum_{i=1..j} (prime(primepi(n) + i) mod n). Numbers n such that there exists j with s(n,j) = n.
(history; published version)

#18 by N. J. A. Sloane at Wed Jun 22 23:48:43 EDT 2016

STATUS

editing

approved

#17 by N. J. A. Sloane at Wed Jun 22 23:48:34 EDT 2016

NAME

Let s(n,j) be Sum_{i=1..j} (prime(primepi(n) + i) mod n). Numbers n such that there exists j such that with s(n,j) = n.

STATUS

proposed

editing

Discussion

Wed Jun 22

23:48

N. J. A. Sloane: edited

#16 by David A. Corneth at Wed Jun 22 10:47:09 EDT 2016

STATUS

editing

proposed

#15 by David A. Corneth at Wed Jun 22 10:46:55 EDT 2016

EXTENSIONS

Name corrected by David A. Corneth, Jun 22 2016

Discussion

Wed Jun 22

10:47

David A. Corneth: Put extension as well.

#14 by David A. Corneth at Wed Jun 22 10:44:41 EDT 2016

NAME

Let s(n,j) be Sum_{i=1..j} (prime(primepi(n) + i) mod n). Numbers n such that there exists j such that s(n,j) = n.

Discussion

Wed Jun 22

10:46

David A. Corneth: Changed name. In old name, k had two meanings. Okay?

#13 by David A. Corneth at Wed Jun 22 10:43:47 EDT 2016

NAME

Let s(n,j) be Sum_{i=1..j} prime(primepi(n) + i). Numbers n for which n = Sum_{k=1..such that there exists j}{k mod n}, where k > such that s(n are ,j primes nearest to ) = n.

STATUS

proposed

editing

#12 by Paolo P. Lava at Wed Jun 22 10:36:35 EDT 2016

STATUS

editing

proposed

#11 by Paolo P. Lava at Wed Jun 22 10:36:30 EDT 2016

LINKS

Paolo P. Lava, <a href="/A274423/a274423.txt">First 200 terms with the number of primes j</a>

STATUS

proposed

editing

#10 by Paolo P. Lava at Wed Jun 22 07:47:17 EDT 2016

STATUS

editing

proposed

#9 by Paolo P. Lava at Wed Jun 22 07:47:12 EDT 2016

MAPLE

P:=proc(q) local a, b, k; global , n; for n from 2 to q do a:=0; b:=nextprime(n);

b:=nextprime(n); while n>a do a:=a+(b mod n); b:=nextprime(b); od;

STATUS

proposed

editing