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.

A048528 Primes expressible in two ways as the sum of an integer and its digit sum.

This page as a plain text file.
%I A048528 #23 Apr 28 2023 08:17:51
%S A048528 101,103,107,109,113,307,311,313,317,509,521,709,719,911,919,1009,
%T A048528 1013,1213,1217,1409,1607,1609,1613,1619,1621,1811,1823,2017,2027,
%U A048528 2111,2113,2309,2311,2521,2711,2713,2719,2917,2927,3011,3209,3217,3221,3407,3413,3613,3617,3623
%N A048528 Primes expressible in two ways as the sum of an integer and its digit sum.
%H A048528 Delbert L. Johnson, <a href="/A048528/b048528.txt">Table of n, a(n) for n = 1..20000</a>
%e A048528 313 = 296 + (2+9+6) and 313 = 305 + (3+0+5).
%t A048528 Transpose[Select[Tally[Select[#+Total[IntegerDigits[#]]&/@ Range[ 5000], PrimeQ]],#[[2]]==2&]][[1]] (* _Harvey P. Dale_, May 09 2013 *)
%o A048528 (Python)
%o A048528 from collections import Counter
%o A048528 from sympy import isprime
%o A048528 def a_list(upto):
%o A048528     return [i for i, j in Counter([i+sum(map(int, str(i))) for i in range(upto)]).items() if j>1 and isprime(i)]
%o A048528 print(a_list(4000)) # _Nicholas Stefan Georgescu_, Mar 02 2023
%Y A048528 Cf. A047791, A048521.
%K A048528 nonn,base,nice
%O A048528 1,1
%A A048528 _Patrick De Geest_, May 15 1999
%E A048528 Corrected and extended by _Harvey P. Dale_, May 09 2013