login
Number of bases b, 1 < b < n-1, in which n is a palindrome, allowing leading zeros when testing if a number is a palindrome.
4

%I #14 Aug 02 2014 06:23:40

%S 0,0,0,0,1,1,2,1,3,2,4,0,5,1,3,3,5,2,6,0,6,4,2,1,8,2,4,4,6,1,8,2,6,3,

%T 4,2,10,1,3,3,9,1,8,1,4,5,4,0,11,2,6,4,6,0,8,4,8,4,2,1,14,1,4,6,8,5,7,

%U 2,7,3,6,1,14,2,3,5,4,2,9,0,12,5,4,1,14,5,3,2,7,1,13,4,6,4,2,2

%N Number of bases b, 1 < b < n-1, in which n is a palindrome, allowing leading zeros when testing if a number is a palindrome.

%C Every integer n is a palindrome when expressed in unary, or in base n-1 (where it will be 11). So here we assume 1 < b < n-1.

%C Here 4 = 100 counts as a palindrome in base 2, since 00100 is palindromic.

%H Paul Tek, <a href="/A135550/b135550.txt">Table of n, a(n) for n = 0..10000</a>

%H John P. Linderman, <a href="/A135549/a135549.html">Description of A135549-A135551 and A016038</a>

%H John P. Linderman, <a href="/A135549/a135549.txt">Perl program</a> [Use the command: LEADING0S=1 palin.pl]

%Y Cf. A135549, A135551, A016038.

%K nonn,base

%O 0,7

%A _John P. Linderman_, Feb 26 2008, Feb 28 2008