A015195
Sum of Gaussian binomial coefficients for q=9.
Original entry on oeis.org
1, 2, 12, 184, 9104, 1225248, 540023488, 652225844096, 2584219514040576, 28081351726592246272, 1001235747932175990213632, 97915621602690773814148184064, 31420034518763282871588038742544384, 27654326463468067495668136467306727743488
Offset: 0
- J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.
- I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
- M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
-
Total/@Table[QBinomial[n, m, 9], {n, 0, 20}, {m, 0, n}] (* Vincenzo Librandi, Nov 01 2012 *)
Flatten[{1,RecurrenceTable[{a[n]==2*a[n-1]+(9^(n-1)-1)*a[n-2],a[0]==1,a[1]==2},a,{n,1,15}]}] (* Vaclav Kotesovec, Aug 21 2013 *)
A015196
Sum of Gaussian binomial coefficients for q=10.
Original entry on oeis.org
1, 2, 13, 224, 13435, 2266646, 1348019857, 2269339773068, 13484735901526279, 226960944509263279490, 13485189809930561625032701, 2269636415245291711513986785912, 1348523520252401463276762566348539123
Offset: 0
- J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.
- I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
- M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
-
Total/@Table[QBinomial[n, m, 10], {n, 0, 20}, {m, 0, n}] (* Vincenzo Librandi, Nov 01 2012 *)
Flatten[{1,RecurrenceTable[{a[n]==2*a[n-1]+(10^(n-1)-1)*a[n-2],a[0]==1,a[1]==2},a,{n,1,15}]}] (* Vaclav Kotesovec, Aug 21 2013 *)
A228465
Recurrence a(n) = a(n-1) + 2^n*a(n-2) with a(0)=0, a(1)=1.
Original entry on oeis.org
0, 1, 1, 9, 25, 313, 1913, 41977, 531705, 22023929, 566489849, 45671496441, 2366013917945, 376506912762617, 39141278944373497, 12376519796349807353, 2577539376694811306745, 1624792742123856760679161, 677311275106408471956040441, 852536648457739021814912002809
Offset: 0
-
[n le 2 select (n-1) else Self(n-1)+Self(n-2)*2^(n-1): n in [1..20]]; // Vincenzo Librandi, Aug 23 2013
-
RecurrenceTable[{a[n]==a[n-1]+2^n*a[n-2],a[0]==0,a[1]==1},a,{n,0,20}]
(* Alternative: *)
a[n_] := Sum[2^(k^2-1) QBinomial[n - k , k - 1, 2], {k, 1, n}];
Table[a[n], {n, 0, 19}] (* After Vladimir Kruchinin. Peter Luschny, Jan 20 2020 *)
-
def a(n):
return sum(2^(k^2 - 1)*q_binomial(n-k , k-1, 2) for k in (1..n))
print([a(n) for n in range(20)]) # Peter Luschny, Jan 20 2020
A015197
Sum of Gaussian binomial coefficients for q=11.
Original entry on oeis.org
1, 2, 14, 268, 19156, 3961832, 3092997464, 7024809092848, 60287817008722576, 1505950784990730735392, 142158530752430089391520224, 39060769254069395008311334483648, 40559566021977397260316290099710383936
Offset: 0
- J. Goldman and G.-C. Rota, The number of subspaces of a vector space, pp. 75-83 of W. T. Tutte, editor, Recent Progress in Combinatorics. Academic Press, NY, 1969.
- I. P. Goulden and D. M. Jackson, Combinatorial Enumeration. Wiley, NY, 1983, p. 99.
- M. Sved, Gaussians and binomials, Ars. Combinatoria, 17A (1984), 325-351.
-
Total/@Table[QBinomial[n, m, 11], {n, 0, 20}, {m, 0, n}] (* Vincenzo Librandi, Nov 02 2012 *)
Flatten[{1,RecurrenceTable[{a[n]==2*a[n-1]+(11^(n-1)-1)*a[n-2],a[0]==1,a[1]==2},a,{n,1,15}]}] (* Vaclav Kotesovec, Aug 21 2013 *)
A348106
a(n) is the number of vector subspaces in (F_8)^n, counted up to coordinate permutation.
Original entry on oeis.org
1, 2, 7, 36, 338, 6370, 301736, 34015760, 10395343595, 7592404159342
Offset: 0
Showing 1-5 of 5 results.
Comments