I have forgotten
my Password

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
get GPL
COST (GBP)
this unit 0.70
sub units 0.00
+
0

Young Number

Calculates the Young tableau number of the given order.
Controller: CodeCogs

get GPL add to cart

Interface

C++
Excel
HTML

Young Number

 
intyoung_numberintn )
This function computes the Young tableau number of order n, using the following recurrent sequence:

with initial values

Example:

#include <codecogs/maths/combinatorics/sequences/young_number.h>
#include <iostream>
int main()
{
  std::cout << "Young tableau numbers for 0 < n < 10" << std::endl;
  for (int i = 1; i < 10; i++)
    std::cout << i << "  " << Maths::Combinatorics::Sequences::young_number(i) << std::endl;
  return 0;
}

Output:

Young tableau numbers for 0 < n < 10
1  1
2  2
3  4
4  10
5  26
6  76
7  232
8  764
9  2620

References:

SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.html

Parameters

nthe desired order

Returns

the Young tableau number 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.