This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182604 #29 Sep 08 2022 08:45:55 %S A182604 1,8,80,720,6552,58960,531360,4782160,43045920,387413208,3486777120, %T A182604 31380993360,282429470960,2541865231440,22876791858720, %U A182604 205891126722080,1853020183479912,16677181651254480,150094635248646000,1350851717237225040,12157665458621220720 %N A182604 Number of conjugacy classes in GL(n,9). %H A182604 Alois P. Heinz, <a href="/A182604/b182604.txt">Table of n, a(n) for n = 0..350</a> %F A182604 G.f.: Product_{k>=1} (1-x^k)/(1-9*x^k). - _Alois P. Heinz_, Nov 03 2012 %p A182604 with(numtheory): %p A182604 b:= proc(n) b(n):= add(phi(d)*9^(n/d), d=divisors(n))/n-1 end: %p A182604 a:= proc(n) a(n):= `if`(n=0, 1, %p A182604 add(add(d*b(d), d=divisors(j)) *a(n-j), j=1..n)/n) %p A182604 end: %p A182604 seq(a(n), n=0..30); # _Alois P. Heinz_, Nov 03 2012 %t A182604 b[n_] := Sum[EulerPhi[d]*9^(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_ *) %o A182604 (Magma) /* The program does not work for n>6: */ [1] cat [NumberOfClasses(GL(n, 9)): n in [1..6]]; %o A182604 (PARI) %o A182604 N=66; x='x+O('x^N); %o A182604 gf=prod(n=1,N, (1-x^n)/(1-9*x^n) ); %o A182604 v=Vec(gf) %o A182604 /* _Joerg Arndt_, Jan 24 2013 */ %Y A182604 Cf. A006951, A006952, A049314, A049315, A049316, A182603, A182605, A182606, A182607, A182608, A182609, A182610, A182611, A182612. %K A182604 nonn %O A182604 0,2 %A A182604 _Klaus Brockhaus_, Nov 23 2010 %E A182604 More terms from _Alois P. Heinz_, Nov 03 2012 %E A182604 MAGMA code edited by _Vincenzo Librandi_, Jan 24 2013