%I #16 Jan 01 2024 13:56:19

%S 1,1,1,1,1,1,1,1,1,10,1,293930,206253075,35240152720,3188675231420,

%T 202802465047245,10358022441395860,456703981505085600,

%U 18150420051920130975,190,293930,1,28048800,353697121050

%N Binomial(max(n,R(n)),min(n,R(n))) where R(n) is the reversal of n.

%C a(n) = Binomial(n,reverse(n)) if n >= reverse(n); = Binomial(reverse(n),n) if n < reverse(n).

%C a(n) = 1 if n is a palindrome. a(n) = n if n = 10^k. - _Amarnath Murthy_, Jul 14 2005

%H Harvey P. Dale, <a href="/A071938/b071938.txt">Table of n, a(n) for n = 1..1000</a>

%e a(10) = binomial(10,1) = 10, a(11) = 1, a(12) = binomial(21,12) = 293930.

%p R:=proc(n) local nn, nnn: nn:=convert(n,base,10): add(nn[nops(nn)+1-j]*10^(j-1),j=1..nops(nn)) end: seq(binomial(max(n,R(n)),min(n,R(n))),n=1..27); # _Emeric Deutsch_, Jul 16 2005

%t bmm[n_]:=Module[{ir=IntegerReverse[n]},Binomial[Max[n,ir],Min[n,ir]]]; Array[ bmm,30] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Dec 13 2020 *)

%K base,nonn

%O 1,10

%A _Joseph L. Pe_, Jun 14 2002

%E Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 23 2007