The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230046 Palindromic primes with nondecreasing sum of digits. 1
 2, 3, 5, 7, 151, 181, 191, 353, 373, 383, 727, 757, 787, 797, 17971, 19891, 19991, 38783, 74747, 75557, 76367, 76667, 77477, 77977, 78787, 78887, 79697, 79997, 1879781, 1895981, 1969691, 1987891, 1988891, 1998991, 3799973, 3899983, 3997993, 3998993, 7696967 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(1) = 2; a(n+1) is the smallest palindromic prime with sum of digits >= sum of digits of a(n). LINKS Shyam Sunder Gupta, Table of n, a(n) for n = 1..157 MATHEMATICA a = {}; t = 0; Do[z = n*10^(IntegerLength[n] - 1) + FromDigits@Rest@Reverse@IntegerDigits[n]; If[PrimeQ[z], s = Apply[Plus, IntegerDigits[z]]; If[s >= t, t = s; AppendTo[a, z]]], {n, 10^5}]; a CROSSREFS Cf. A002385, A067954. Sequence in context: A054218 A075048 A281021 * A098463 A064155 A230047 Adjacent sequences:  A230043 A230044 A230045 * A230047 A230048 A230049 KEYWORD nonn,base AUTHOR Shyam Sunder Gupta, Oct 06 2013 STATUS approved

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

Last modified December 3 18:19 EST 2021. Contains 349467 sequences. (Running on oeis4.)