ASM Number
Returns the number of alternating sign matrices of the given order.
Controller:
CodeCogs
Interface
#include <codecogs/maths/combinatorics/sequences/asm_number.h>
using namespace Maths::Combinatorics::Sequences;
| int | asm_number (int n)
Returns the number of alternating sign matrices of the given order. |
These functions are available for Microsoft Excel (
Login to download):
| Integer | cc_asm_number (Integer n) |
Use the following HTML code to embed the calculators within other websites:
| Name | HTML Code |
|---|
asm_number
Returns the number of alternating sign matrices of the given order. | |
Asm Number
A direct formula for calculating the number of alternating sign matrices of order
n is:
References:
SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.html
Example 1
#include <codecogs/maths/combinatorics/sequences/asm_number.h>
#include <iostream>
int main()
{
for (int i = 0; i < 10; i++)
std::cout << i << " " << Maths::Combinatorics::Sequences::asm_number(i) << std::endl;
return 0;
}
Output:
0 1
1 1
2 2
3 7
4 42
5 429
6 7436
7 218348
8 10850216
9 188958604
Parameters
| n | the order of the matrices |
Returns
- the number of alternating matrices of order n
Authors
- Lucian Bentea (August 2005)
Source Code
Source code is available when you agree to a GP Licence or buy a Commercial Licence.
Not a member, then Register with CodeCogs. Already a Member, then Login.
You must login to leave a messge