Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134063
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134063 Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which x is not a subset of y and y is not a subset of x, or 1) x and y are intersecting and for which either x is a proper subset of y or y is a proper subset of x, or 2) x = y. +0
1
1, 2, 7, 26, 91, 302, 967, 3026, 9331, 28502, 86527, 261626, 788971, 2375102, 7141687, 21457826, 64439011, 193448102, 580606447, 1742343626, 5228079451 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = (1/2)(3^(n+1) - 2^(n+2) + 3) = 3*StirlingS2(n+1,3) + StirlingS2(n+1,2) + 1.

a(n) = StirlingS2(n+2,3) + 1. - Ross La Haye (rlahaye(AT)new.rr.com), Jan 21 2008

EXAMPLE

a(2) = 7 because for P(A) = {{},{1},{2},{1,2}} we have for case 0

{{1},{2}}, and we have for case 1 {{1},{1,2}}, {2},{1,2}}, and we have for

case 2 {{},{}}, {{1},{1}}, {{2},{2}}, {{1,2},{1,2}}.

CROSSREFS

Cf. A000392, A028243, A000079.

Sequence in context: A091145 A000697 A027417 this_sequence A087448 A129273 A055988

Adjacent sequences: A134060 A134061 A134062 this_sequence A134064 A134065 A134066

KEYWORD

nonn

AUTHOR

Ross La Haye (rlahaye(AT)new.rr.com), Jan 11 2008

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 December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research