Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001909 a(n) = n*a(n-1) + (n-4)*a(n-2).
(Formerly M3576 N1450)
+0
15
0, 1, 4, 21, 134, 1001, 8544, 81901, 870274, 10146321, 128718044, 1764651461, 25992300894, 409295679481, 6860638482424, 121951698034461, 2291179503374234, 45361686034627361, 943892592746534964 (list; graph; listen)
OFFSET

2,3

COMMENT

With offset 1, permanent of (0,1)-matrix of size n X (n+d) with d=4 and n zeros not on a line. This is a special case of Theorem 2.3 of Seok-Zun Song et al. Extremes of permanents of (0,1)-matrices, p. 201-202. - Jaap Spies (j.spies(AT)hccnet.nl), Dec 12 2003

REFERENCES

Brualdi, Richard A., and Ryser, Herbert J., Combinatorial Matrix Theory, Cambridge NY (1991), Chapter 7.

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 188.

Seok-Zun Song et al., Extremes of permanents of (0,1)-matrices, Lin. Algebra and its Applic. 373 (2003), p. 197-210.

FORMULA

E.g.f.: exp(-x)/(1-x)^5 = sum_{n>=0} a(n+3)/n! x^n. - Michael Somos, Feb 19 2003

PROGRAM

(PARI) a(n)=if(n<2, 0, -contfracpnqn(matrix(2, n, i, j, j-4*(i==1)))[1, 1])

CROSSREFS

Cf. A000255, A000153, A000261, A001910, A090010, A055790, A090012-A090016.

Sequence in context: A090366 A131965 A104982 this_sequence A052852 A121124 A087761

Adjacent sequences: A001906 A001907 A001908 this_sequence A001910 A001911 A001912

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research