[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A058846 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numbers k such that the sum of odd primes up to k is palindromic.
(history; published version)
#32 by Michel Marcus at Sat Mar 06 02:09:02 EST 2021
STATUS

reviewed

approved

#31 by Joerg Arndt at Sat Mar 06 01:59:59 EST 2021
STATUS

proposed

reviewed

#30 by Joerg Arndt at Sat Mar 06 01:59:52 EST 2021
STATUS

editing

proposed

#29 by Joerg Arndt at Sat Mar 06 01:59:50 EST 2021
NAME

Sum Numbers k such that the sum of odd primes up to n k is palindromic.

COMMENTS

Sum is 3 + 5 + 7 + 11 + 13 + 17 + ... + nk.

STATUS

proposed

editing

#28 by Michel Marcus at Fri Mar 05 17:36:19 EST 2021
STATUS

editing

proposed

#27 by Michel Marcus at Fri Mar 05 17:36:16 EST 2021
LINKS

P. Patrick De Geest, <a href="http://www.worldofnumbers.com/firstpal.htm#sfn2">Palindromic Sums</a>

CROSSREFS
STATUS

proposed

editing

#26 by Michael S. Branicky at Fri Mar 05 15:09:20 EST 2021
STATUS

editing

proposed

#25 by Michael S. Branicky at Fri Mar 05 15:09:15 EST 2021
PROG

(Python)

from sympy import primerange

def ispal(n): s = str(n); return s == s[::-1]

def afind(limit):

s = 0

for p in primerange(3, limit):

s += p

if ispal(s): print(p, end=", ")

afind(2*10**6) # Michael S. Branicky, Mar 05 2021

STATUS

approved

editing

#24 by Giovanni Resta at Sat Sep 01 05:02:12 EDT 2018
STATUS

editing

approved

#23 by Giovanni Resta at Sat Sep 01 05:02:07 EDT 2018
CROSSREFS
STATUS

approved

editing