The OEIS is supported by the many generous donors to the OEIS 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275220 a(n) is the smallest integer with at least n palindromic representations of length >= 3 in bases b >= 2. 0
 5, 17, 65, 121, 562, 1432, 1477, 4369, 35101, 35101, 83161, 83161, 291721, 291721, 720721, 887041, 1496881, 1670761, 3341521, 3341521, 5654881, 7207201, 7761601, 10810801, 12252241, 15135121, 21621601, 28274401, 28274401, 41081041, 41081041, 41081041 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(9) and a(10) are identical because there is no number less than 35101 with nine palindromic representations in different bases; likewise for a(11) and a(12), and for a(13) and a(14). LINKS Table of n, a(n) for n=1..32. PROG (PARI) isok(k, n) = sum(b=2, k-1, (d=digits(k, b)) && (#d >= 3) && (Vecrev(d) == d)) >= n; a(n) = my(j=1); while(! isok(j, n), j++); j; \\ Michel Marcus, Jul 28 2016 CROSSREFS Cf. A123586. Sequence in context: A149670 A149671 A366978 * A062229 A349567 A273483 Adjacent sequences: A275217 A275218 A275219 * A275221 A275222 A275223 KEYWORD base,nonn AUTHOR Clive Stott, Jul 20 2016 EXTENSIONS a(17)-a(32) from Giovanni Resta, Jul 28 2016 STATUS approved

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.

Last modified December 11 09:49 EST 2023. Contains 367722 sequences. (Running on oeis4.)