login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114533 a(n) = permanent of the n X n matrix M defined as follows: if we concatenate the rows of M to form a vector v of length n^2, v_i is the i-th prime number. 0
2, 29, 3746, 1919534, 2514903732, 6571874957648, 30662862975835376, 228731722381012564816, 2641049525155781555257440, 43818773386947889568479502592, 1014966115357067575070490776083200 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Simone Severini, www-users.york.ac.uk/~ss54.

PROG

(PARI) permRWN(a)=n=matsize(a)[1]; if(n==1, return(a[1, 1])); n1=n-1; sg=1; m=1; nc=0; in=vector(n); x=in; for(i=1, n, x[i]=a[i, n]-sum(j=1, n, a[i, j])/2); p=prod(i=1, n, x[i]); while(m, sg=-sg; j=1; if((nc%2)!=0, j++; while(in[j-1]==0, j++)); in[j]=1-in[j]; z=2*in[j]-1; nc+=z; m=nc!=in[n1]; for(i=1, n, x[i]+=z*a[i, j]); p+=sg*prod(i=1, n, x[i])); return(2*(2*(n%2)-1)*p) for(n=1, 19, a=matrix(n, n, i, j, prime((i-1)*n+j)); print1(permRWN(a)", ")) - Herman Jamke (hermanjamke(AT)fastmail.fm), May 11 2007

(PARI) permRWNb(a)=n=matsize(a)[1]; if(n==1, return(a[1, 1])); sg=1; in=vectorv(n); x=in; x=a[, n]-sum(j=1, n, a[, j])/2; p=prod(i=1, n, x[i]); for(k=1, 2^(n-1)-1, sg=-sg; j=valuation(k, 2)+1; z=1-2*in[j]; in[j]+=z; x+=z*a[, j]; p+=prod(i=1, n, x[i], sg)); return(2*(2*(n%2)-1)*p) for(n=1, 23, a=matrix(n, n, i, j, prime((i-1)*n+j)); print1(permRWNb(a)", ")) - Herman Jamke (hermanjamke(AT)fastmail.fm), May 15 2007

CROSSREFS

Sequence in context: A077282 A059725 A112784 * A180128 A087194 A058988

Adjacent sequences:  A114530 A114531 A114532 * A114534 A114535 A114536

KEYWORD

nonn

AUTHOR

Simone Severini (simoseve(AT)gmail.com), Feb 15 2006

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 11 2007

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 15 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.