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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065809 a(n) = smallest number m>n such that m is palindromic in base n and is not palindromic in bases b with 2 <= b < n. 1

%I

%S 3,4,25,6,14,32,54,30,11,84,39,140,75,176,102,198,19,220,147,110,69,

%T 384,175,416,486,420,58,570,279,544,429,306,245,684,296,380,663,880,

%U 615,1134,258,1012,1035,1104,47,1392,539,1500,1071,1508,53,2106

%N a(n) = smallest number m>n such that m is palindromic in base n and is not palindromic in bases b with 2 <= b < n.

%H Robert Israel, <a href="/A065809/b065809.txt">Table of n, a(n) for n = 2..442</a>

%p N:= 100:

%p f:= proc(m) local k,L;

%p for k from 2 to m do

%p L:= convert(m,base,k);

%p if L = ListTools:-Reverse(L) then return k fi

%p od;

%p FAIL

%p end proc:

%p V:= Array(2..N):

%p count:= 0:

%p for m from 3 while count < N-1 do

%p v:= f(m);

%p if v = FAIL or v > N then next fi;

%p if V[v] = 0 then count:= count+1; V[v]:= m;

%p fi

%p od:

%p convert(V,list); # _Robert Israel_, Apr 08 2019

%Y Cf. A065531.

%K easy,nonn

%O 2,1

%A _Naohiro Nomoto_, Dec 06 2001

%E Definition edited by _N. J. A. Sloane_, Apr 08 2019

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 September 20 23:04 EDT 2021. Contains 347596 sequences. (Running on oeis4.)