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!)
A364073 Triangle read by rows: T(n, k) = Sum_{d=0..n-k} binomial(n, d)*StirlingS2(n-d, k)*624^(n-d-k), with 0 <= k <= n. 3

%I #6 Jul 06 2023 21:14:07

%S 1,1,1,1,626,1,1,391251,1875,1,1,244531876,2733126,3748,1,1,

%T 152832422501,3658206250,9753130,6245,1,1,95520264063126,

%U 4721932028751,21925818740,25346895,9366,1,1,59700165039453751,5993213367973125,45788990528771,85217015555,54578181,13111,1

%N Triangle read by rows: T(n, k) = Sum_{d=0..n-k} binomial(n, d)*StirlingS2(n-d, k)*624^(n-d-k), with 0 <= k <= n.

%C T(n, k) is the number of 625-subgroups of R^n which have dimension k, where R^n is a near-vector space over a proper nearfield R.

%H Prudence Djagba and Jan Hązła, <a href="https://arxiv.org/abs/2306.16421">Combinatorics of subgroups of Beidleman near-vector spaces</a>, arXiv:2306.16421 [math.RA], 2023. See pp. 7-9.

%e The triangle begins:

%e 1;

%e 1, 1;

%e 1, 626, 1;

%e 1, 391251, 1875, 1;

%e 1, 244531876, 2733126, 3748, 1;

%e 1, 152832422501, 3658206250, 9753130, 6245, 1;

%e ...

%t T[n_,k_]:=Sum[Binomial[n,d]StirlingS2[n-d,k]624^(n-d-k),{d,0,n-k}]; Table[T[n,k],{n,0,7},{k,0,n}]//Flatten

%Y Cf. A000012 (k=0), A364070 (row sums), A364071, A364072.

%K nonn,tabl

%O 0,5

%A _Stefano Spezia_, Jul 04 2023

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 September 10 21:37 EDT 2024. Contains 375795 sequences. (Running on oeis4.)