|
Search: id:A060868
|
|
|
| A060868 |
|
Number of n X n matrices over GF(3) with rank 1. |
|
+0
2
|
|
| 2, 32, 338, 3200, 29282, 264992, 2389298, 21516800, 193690562, 1743333152, 15690352658, 141214236800, 1270931319842, 11438391444512, 102945551698418, 926510051379200, 8338590720693122, 75047317261079072, 675425857674234578
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,200
|
|
FORMULA
|
a(n) = 1/2 * (3^n - 1)^2
|
|
EXAMPLE
|
a(2) = 32 because there are 33 (the second element in sequence A060705) singular 2X2 matrices over GF(3), that have rank <= 1 of which only the zero matrix has rank zero so a(2) = 33 - 1 = 32.
|
|
PROGRAM
|
(PARI) { for (n=1, 200, write("b060868.txt", n, " ", (3^n - 1)^2 / 2); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 13 2009]
|
|
CROSSREFS
|
Cf. A060705, A060867, A060869.
Sequence in context: A079766 A053065 A091707 this_sequence A127697 A109772 A115418
Adjacent sequences: A060865 A060866 A060867 this_sequence A060869 A060870 A060871
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Ahmed Fares (ahmedfares(AT)my-deja.com), May 04 2001
|
|
EXTENSIONS
|
More terms from Jason Earls (zevi_35711(AT)yahoo.com), May 05 2001
|
|
|
Search completed in 0.002 seconds
|
