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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052387 Number of 3 X n binary matrices such that any 2 rows have a common 1, up to column permutations. 0
0, 1, 8, 37, 127, 358, 876, 1926, 3894, 7359, 13156, 22451, 36829, 58396, 89896, 134844, 197676, 283917, 400368, 555313, 758747, 1022626, 1361140, 1791010, 2331810, 3006315, 3840876, 4865823, 6115897, 7630712, 9455248 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6).

LINKS

Table of n, a(n) for n=0..30.

Index to sequences with linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8,-1).

FORMULA

a(n) = n*(n+1)*(n+2)*(n+3)*(n^3+22*n^2+53*n+134)/5040.

G.f.: -x*(x^3-x^2-1)/(x-1)^8. [Colin Barker, Nov 05 2012]

CROSSREFS

Cf. A051588, A051587, A051589.

Sequence in context: A203020 A050536 A110215 * A001780 A053296 A055799

Adjacent sequences:  A052384 A052385 A052386 * A052388 A052389 A052390

KEYWORD

nonn,easy

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Mar 11 2000

STATUS

approved

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 May 23 14:31 EDT 2013. Contains 225603 sequences.