|
|
A221579
|
|
A sum over partitions (q=10), see first comment.
|
|
9
|
|
|
1, 9, 99, 990, 9990, 99891, 999900, 9998901, 99998910, 999989010, 9999989010, 99999889110, 999999890109, 9999998890200, 99999998891100, 999999988901199, 9999999988902090, 99999999888912090, 999999999889011990, 9999999998889021990
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Set q=10 and f(m)=q^(m-1)*(q-1), then a(n) is the sum over all partitions P of n over all products Product_{k=1..L} f(m_k) where L is the number of different parts in the partition P = [p_1^m_1, p_2^m_2, ..., p_L^m_L].
Setting q to a prime power gives the sequence "Number of conjugacy classes in GL(n,q)":
Sequences where q is not a prime power:
|
|
LINKS
|
|
|
MAPLE
|
with(numtheory):
b:= proc(n) b(n):= add(phi(d)*10^(n/d), d=divisors(n))/n-1 end:
a:= proc(n) a(n):= `if`(n=0, 1,
add(add(d*b(d), d=divisors(j)) *a(n-j), j=1..n)/n)
end:
|
|
MATHEMATICA
|
b[n_] := Sum[EulerPhi[d]*10^(n/d), {d, Divisors[n]}]/n-1; a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d*b[d], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 17 2014, after Alois P. Heinz *)
|
|
PROG
|
(PARI)
N=66; x='x+O('x^N);
gf=prod(n=1, N, (1-x^n)/(1-10*x^n) );
v=Vec(gf)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|