login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164590 Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^7 = I. 1

%I #16 Sep 08 2022 08:45:47

%S 1,11,110,1100,11000,110000,1100000,10999945,109998900,1099983555,

%T 10999781100,109997266500,1099967220000,10999617750000,

%U 109995633002970,1099950885086625,10999454401704780,109993999528128375

%N Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^7 = I.

%C The initial terms coincide with those of A003953, although the two sequences are eventually different.

%C Computed with MAGMA using commands similar to those used to compute A154638.

%H G. C. Greubel, <a href="/A164590/b164590.txt">Table of n, a(n) for n = 0..995</a>

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (9,9,9,9,9,9,-45).

%F G.f.: (t^7 + 2*t^6 + 2*t^5 + 2*t^4 + 2*t^3 + 2*t^2 + 2*t + 1)/(45*t^7 - 9*t^6 - 9*t^5 - 9*t^4 - 9*t^3 - 9*t^2 - 9*t + 1).

%F a(n) = -45*a(n-7) + 9*Sum_{k=1..6} a(n-k). - _Wesley Ivan Hurt_, May 11 2021

%p seq(coeff(series((1+t)*(1-t^7)/(1-10*t+54*t^7-45*t^8), t, n+1), t, n), n = 0 .. 30); # _G. C. Greubel_, Aug 28 2019

%t CoefficientList[Series[(1+t)*(1-t^7)/(1-10*t+54*t^7-45*t^8), {t, 0, 30}], t] (* _G. C. Greubel_, Aug 12 2017 *)

%t coxG[{7, 45, -9}] (* The coxG program is at A169452 *) (* _G. C. Greubel_, Aug 28 2019 *)

%o (PARI) my(t='t+O('t^30)); Vec((1+t)*(1-t^7)/(1-10*t+54*t^7-45*t^8)) \\ _G. C. Greubel_, Aug 12 2017

%o (Magma) R<t>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (1+t)*(1-t^7)/(1-10*t+54*t^7-45*t^8) )); // _G. C. Greubel_, Aug 28 2019

%o (Sage)

%o def A164590_list(prec):

%o P.<t> = PowerSeriesRing(ZZ, prec)

%o return P((1+t)*(1-t^7)/(1-10*t+54*t^7-45*t^8)).list()

%o A164590_list(30) # _G. C. Greubel_, Aug 28 2019

%o (GAP) a:=[11, 110, 1100, 11000, 110000, 1100000, 10999945];; for n in [8..30] do a[n]:=9*(a[n-1] +a[n-2]+a[n-3]+a[n-4]+a[n-5]+a[n-6]) -45*a[n-7]; od; Concatenation([1], a); # _G. C. Greubel_, Aug 28 2019

%K nonn

%O 0,2

%A _John Cannon_ and _N. J. A. Sloane_, Dec 03 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 04:56 EDT 2024. Contains 372300 sequences. (Running on oeis4.)