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.

A191221 Numbers k such that k plus the sum of the digits of k is prime, and R(k) plus the sum of the digits of k is prime, where R(k) = A004086(k).

Original entry on oeis.org

1, 10, 11, 19, 35, 37, 53, 59, 73, 91, 95, 100, 101, 143, 181, 218, 232, 250, 272, 296, 298, 323, 341, 343, 365, 383, 385, 418, 436, 454, 490, 509, 527, 547, 563, 583, 610, 634, 650, 656, 670, 692, 725, 727, 745, 749, 767, 787, 812, 814, 838, 850, 892, 905, 947, 949, 1009
Offset: 1

Views

Author

Carmine Suriano, May 27 2011

Keywords

Comments

Numbers ending with zero(s) when reversed have fewer digits.

Examples

			143 and 341 belong to the sequence since 143 + (1+4+3) = 151 is prime and 341 + (3+4+1) = 349 is also a prime.
		

Crossrefs

Programs

  • Maple
    read(transforms): isA191221 := proc(n) local r: r:=digrev(n): return (isprime(n+digsum(n)) and isprime(r+digsum(r))): end: A191221 := proc(n) option remember: local k: if(n=1)then return 1: fi: for k from procname(n-1)+1 do if(isA191221(k))then return k: fi: od: end: seq(A191221(n),n=1..57); # Nathaniel Johnston, May 27 2011
  • Mathematica
    nrQ[n_]:=Module[{idn=IntegerDigits[n],t},t=Total[idn];And@@PrimeQ[{n+t, FromDigits[Reverse[idn]]+t}]]; Select[Range[1200],nrQ] (* Harvey P. Dale, Feb 24 2013 *)