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!)
A232553 Maximal values of permanent on (0,1) square matrices of order n with row and column sums 3. 2

%I #29 May 27 2016 13:33:38

%S 6,9,13,36,54,81,216,324,486,1296,1944,2916,7776,11664,17496,46656,

%T 69984,104976,279936,419904,629856,1679616,2519424,3779136,10077696,

%U 15116544,22674816,60466176,90699264,136048896,362797056,544195584,816293376,2176782336,3265173504,4897760256

%N Maximal values of permanent on (0,1) square matrices of order n with row and column sums 3.

%C a(n) attains on subset of symmetric matrices with the main diagonal of 1's.

%H Colin Barker, <a href="/A232553/b232553.txt">Table of n, a(n) for n = 3..1000</a>

%H D. Merriell, <a href="http://www.tandfonline.com/doi/abs/10.1080/03081088008817354">The maximum permanents in Lambda_n,k</a>, Linear and Multilinear Algebra, 1980, no.9, 81-91.

%H V. S. Shevelev, <a href="http://dx.doi.org/10.1007/BF01104103">Some problems of the theory of enumerating the permutations with restricted position</a>, Journal of Soviet Mathematics, 61 (4) (1992) 2272-2317

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,6).

%F a(n) = floor(6^((n-h)/3)*(3/2)^h), where h=0,1 or 2, such that n == h (mod 3).

%F From _Colin Barker_, May 27 2016: (Start)

%F a(n) = 6*a(n-3) for n>5.

%F G.f.: x^3*(6+9*x+13*x^2+3*x^5) / (1-6*x^3).

%F (End)

%o (PARI) a(n) = h = n%3; floor(6^((n-h)/3)*(3/2)^h); \\ _Michel Marcus_, Nov 26 2013

%o (PARI) Vec(x^3*(6+9*x+13*x^2+3*x^5)/(1-6*x^3) + O(x^50)) \\ _Colin Barker_, May 27 2016

%Y Cf. A176211, A176212, A185177, A185178, A185179.

%K nonn,easy

%O 3,1

%A _Vladimir Shevelev_, Nov 26 2013

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 April 24 05:33 EDT 2024. Contains 371918 sequences. (Running on oeis4.)