Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153836
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153836 a(n) = 2^(n^2) - 2^(n^2-n+1) for n >= 1; a(0) = 0. +0
1
0, 0, 8, 384, 57344, 31457280, 66571993088, 554153860399104, 18302628885633695744, 2408406906263519058984960, 1265174720149658640946904956928, 2655859843140564331993348872396079104 (list; graph; listen)
OFFSET

0,3

COMMENT

Number of binary relations on an n-element set that are neither reflexive nor irreflexive. Note that "irreflexive" = "antireflexive".

The empty relation, unlike all others, is (trivially) both reflexive and irreflexive.

FORMULA

a(n) = 2^(n^2) - 2^(n^2-n+1) = A002416(n) - 2*A053763(n) for n >= 1; a(0) = 0.

PROGRAM

(PARI) a(n) = if(n<=0, 0, 2^(n^2)-2^(n^2-n+1))

CROSSREFS

Cf. A002416, A053763.

Sequence in context: A162445 A067624 A096204 this_sequence A151941 A085806 A042115

Adjacent sequences: A153833 A153834 A153835 this_sequence A153837 A153838 A153839

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jan 02 2009

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research