OFFSET
1,5
COMMENTS
The reference gives more terms, formulas, connection with A003112, etc.
s(pi):= Sum_{j=0..n-1} j*pi(j) (mod j) is defined to be the spread of a permutation pi of [0..(n-1)].
LINKS
R. L. Graham and D. H. Lehmer, On the Permanent of Schur's Matrix, J. Australian Math. Soc., 21A (1976), 487-497.
EXAMPLE
Triangle begins:
1
1 1
0 3 3
4 8 4 8
20 25 25 25 25
144 108 108 144 108 108
...
MAPLE
b:= proc(n) option remember;
local l, p, r;
l:= array([i$i=0..n-1]);
r:= array([0$i=1..n]);
p:= proc(t, s)
local d, h, j;
if t=n then d:= ((s+(n-1)*l[n]) mod n) +1;
r[d]:= r[d]+1
else for j from t to n do
l[t], l[j]:= l[j], l[t];
p(t+1, (s+(t-1)*l[t]) )
od;
h:= l[t];
for j from t to n-1 do l[j]:= l[j+1] od;
l[n]:= h
fi
end;
p(1, 0);
eval(r)
end:
T:= (n, k)-> b(n)[k+1]:
seq (seq (T(n, k), k=0..n-1), n=1..10);
MATHEMATICA
b[n_] := b[n] = Module[{l, p, r}, l = Range[0, n-1]; r = Array[0&, n]; p [t_, s_] := Module[{d, h, j}, If[t == n, d = Mod[s+(n-1)*l[[n]], n]+1; r[[d]] = r[[d]]+1, For[j = t, j <= n, j++, {l[[t]], l[[j]]} = {l[[j]], l[[t]]}; p[t+1, s+(t-1)*l[[t]]]]; h = l[[t]]; For[j = t, j <= n-1, j++, l[[j]] = l[[j+1]]]; l[[n]] = h]]; p[1, 0]; r]; t[n_, k_] := b[n][[k+1]]; Table [Print[t[n, k]]; t[n, k], {n, 1, 10}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Apr 17 2014, after Alois P. Heinz *)
PROG
(Sage)
@CachedFunction
def A147679_row(n):
row = [0]*n
for p in Permutations(range(n)):
spread = sum(i*px for i, px in enumerate(p)) % n
row[spread] += 1
return row
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, May 01 2009
EXTENSIONS
Edited by Alois P. Heinz, Dec 22 2010
STATUS
approved