A048525 -id:A048525 - cp's OEIS frontend

A048527 Primes for which only five iterations of 'Prime plus its digit sum equals a prime' are possible.

516493, 1056493, 1427383, 1885943, 3166183, 3805183, 4241593, 6621283, 7646953, 12912283, 17987839, 32106493, 107152093, 120224773, 131144473, 133210873, 139388891, 142782877, 150326173, 155382923, 177865819, 184081943, 227795839, 242376877, 264174877

Offset: 1

Patrick De Geest, May 15 1999

			516493 -> 516521 -> 516541 -> 516563 -> 516589 -> 516623 -> next iteration yields a composite.

Lars Blomberg, Table of n, a(n) for n = 1..3000

Cf. A047791, A048519, A062028 (n + digit sum of n).

Cf. A048523, A048524, A048525, A048526.

forprime(p=2,,isprime(pp=A062028(p))&& !for(i=2,5,isprime(pp=A062028(pp))||next(2))&& !isprime(A062028(pp))&& print1(p",")) \\ M. F. Hasler, Nov 08 2018

Offset changed to 1 and a(15)-a(24) from Lars Blomberg, Dec 04 2013

A320882 Primes p such that repeated application of A062028 (add sum of digits) yields two other primes in a row: p, A062028(p) and A062028(A062028(p)) are all prime.

Original entry on oeis.org

11, 59, 101, 149, 167, 257, 277, 293, 367, 419, 479, 547, 617, 727, 839, 1409, 1559, 1579, 1847, 2039, 2129, 2617, 2657, 2837, 3449, 3517, 3539, 3607, 3719, 4217, 4637, 4877, 5689, 5779, 5807, 5861, 6037, 6257, 6761, 7027, 7489, 7517, 8039, 8741, 8969, 9371, 9377, 10667, 10847, 10937, 11257, 11279, 11299, 11657

Offset: 1

M. F. Hasler, Nov 06 2018

"Iterates" the idea of A048519 (p and A062028(p) are prime), also considered in A048523, A048524, A048525, A048526, A048527. (This is the union of A048524, A048525, A048526, A048527 etc. A048525(1) = 277 = a(7).)

Robert Israel, Table of n, a(n) for n = 1..10000

Subsequence of A048519: p and A062028(p) are prime.
Cf. A047791, A048520, A006378, A107740, A243441 (p and p + Hammingweight(p) are prime), A243442 (analog for p - Hammingweight(p)).
Cf. A048523, ..., A048527, A320878, A320879, A320880: primes starting a chain of length 2, ..., 9 under iterations of A062028(n) = n + digit sum of n.

f:= n -> n + convert(convert(n,base,10),`+`):
filter:= proc(n) local x;
if not isprime(n) then return false fi;
x:= f(n);
isprime(x) and isprime(f(x))
end proc:
select(filter, [seq(i,i=3..10000,2)]); # Robert Israel, Dec 17 2020

is_A320882(n,p=n)=isprime(p=A062028(p))&&isprime(A062028(p))&&isprime(n) \\ Putting isprime(n) to the end is more efficient for the frequent case when the terms are already known to be prime.
forprime(p=1,14999,isprime(q=A062028(p))&&isprime(A062028(q))&&print1(p","))

cp's OEIS Frontend

A048527 Primes for which only five iterations of 'Prime plus its digit sum equals a prime' are possible.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Extensions