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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161826 Number of maximal vertex-independent sets in the hypergraph with nodes V = {1, 2, ..., n} and "edges" consisting of the triples (X,Y,Z) with X<Y<Z and X+Y=Z. 3
1, 1, 3, 2, 6, 1, 6, 1, 5, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

A subset S of V is vertex-independent if there is no edge (X,Y,Z) with X, Y, Z all in S.

LINKS

Table of n, a(n) for n=1..99.

FORMULA

a(2k)=1, a(2k+1)=4 for k >= 5.

CROSSREFS

J. Sedlacek, On a set system, Annals New York Acad. Sci., 175 (No. 1, 1970), 329-330.

Cf. A002848, A002849, A108235.

Sequence in context: A244823 A016460 A248645 * A097887 A019761 A188614

Adjacent sequences:  A161823 A161824 A161825 * A161827 A161828 A161829

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 10 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 27 17:28 EDT 2017. Contains 284177 sequences.