login
a(n)= n * reversal(n-1) * reversal(n+1).
1

%I #14 Feb 24 2019 04:30:05

%S 0,6,24,60,120,210,336,504,72,990,231,4092,11193,22134,37515,57936,

%T 83997,116298,3078,21840,924,8448,21252,39936,65100,97344,137268,

%U 185472,7134,35880,2139,13728,32637,59466,94815,139284,193473,257982,12948

%N a(n)= n * reversal(n-1) * reversal(n+1).

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

%e a(8) = 8*R(7)*R(9) = 7*8*9 = 504;

%e a(15) = 15*R(14)*R(16) = 15*41*61 = 37515;

%e a(26) = 26*R(25)*R(27) = 26*52*72 = 97344.

%e a(12) = 12*11*31 = 4092. - _Emeric Deutsch_, Jun 24 2009

%p rev := proc (n) local nn: nn := convert(n, base, 10); add(nn[j]*10^(nops(nn)-j), j = 1 .. nops(nn)) end proc: seq(n*rev(n-1)*rev(n+1), n = 1 .. 40); # _Emeric Deutsch_, Jun 24 2009

%t Table[n*IntegerReverse[n-1]*IntegerReverse[n+1],{n,40}] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 16 2018 *)

%K nonn,base

%O 1,2

%A _Claudio Meller_, May 30 2009