login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327904 Number of labeled simple graphs with vertices {1..n} such that every edge has a different sum. 2
1, 1, 2, 8, 48, 432, 5184, 82944, 1658880, 41472000, 1244160000, 44789760000, 1881169920000, 92177326080000, 5161930260480000, 330363536670720000, 23786174640291840000, 1926680145863639040000, 173401213127727513600000, 17340121312772751360000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Product_{k=1..2*n+1} ceiling(k/4). - Andrew Howroyd, Oct 02 2019
EXAMPLE
The graph with edge-set {{1,2},{1,3},{1,4},{2,3}}, which looks like a triangle with a tail, has edges {1,4} and {2,3} with equal sum, so is not counted under a(4).
MAPLE
a:= proc(n) option remember; `if`(n=0, 1,
a(n-1)*ceil(n/2)*ceil(n/2+1/4))
end:
seq(a(n), n=0..20); # Alois P. Heinz, Oct 03 2019
MATHEMATICA
stableSets[u_, Q_]:=If[Length[u]==0, {{}}, With[{w=First[u]}, Join[stableSets[DeleteCases[u, w], Q], Prepend[#, w]&/@stableSets[DeleteCases[u, r_/; r==w||Q[r, w]||Q[w, r]], Q]]]];
qes[n_]:=stableSets[Subsets[Range[n], {2}], Total[#1]==Total[#2]&];
Table[Length[qes[n]], {n, 0, 5}]
PROG
(PARI) a(n) = {prod(k=1, 2*n+1, ceil(k/4))} \\ Andrew Howroyd, Oct 02 2019
CROSSREFS
The generalization to antichains is A326030.
Sequence in context: A177386 A112541 A052667 * A006925 A185135 A238805
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 30 2019
EXTENSIONS
Terms a(8) and beyond from Andrew Howroyd, Oct 02 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 09:42 EDT 2024. Contains 371268 sequences. (Running on oeis4.)