The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047791 Numbers n such that n plus digit sum of n (A007953) equals a prime. 27

%I #29 Feb 17 2024 10:34:20

%S 1,10,11,13,14,16,19,32,34,35,37,52,53,56,58,59,71,73,76,91,92,94,95,

%T 97,100,101,103,104,106,122,124,127,128,142,143,146,149,160,163,166,

%U 167,181,182,184,185,215,217,218,232,233,238,250,253,256,257,271,272

%N Numbers n such that n plus digit sum of n (A007953) equals a prime.

%H Reinhard Zumkeller, <a href="/A047791/b047791.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>

%F Complement of A107743.

%F A062028^(-1)(A000040). - _M. F. Hasler_, Nov 08 2018

%e Digit sum of 13 = 1 + 3 = 4 -> 13 + 4 = 17 is prime.

%t Select[Range[272],PrimeQ[#+Total[IntegerDigits[#]]]&] (* _Jayanta Basu_, May 03 2013 *)

%o (Haskell)

%o a047791 n = a047791_list !! (n-1)

%o a047791_list = filter ((== 1) . a010051' . a062028) [1..]

%o -- _Reinhard Zumkeller_, Sep 27 2014

%o (PARI) select( is(n)=isprime(n+sumdigits(n)), [1..300]) \\ _M. F. Hasler_, Nov 08 2018

%Y Cf. A006378, A107740.

%Y Cf. A007953, A062028, A010051, A107743.

%K base,easy,nonn

%O 1,2

%A _G. L. Honaker, Jr._

%E More terms from Larry Reeves (larryr(AT)acm.org), Nov 16 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 11:57 EDT 2024. Contains 373173 sequences. (Running on oeis4.)