Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)

Revision History for A000665

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A000665 Number of 3-uniform hypergraphs on n unlabeled nodes, or equivalently number of relations with 3 arguments on n nodes.
(history; published version)
#62 by Alois P. Heinz at Fri Jan 08 04:18:59 EST 2021
STATUS

proposed

approved

#61 by Michel Marcus at Fri Jan 08 02:19:19 EST 2021
STATUS

editing

proposed

#60 by Michel Marcus at Fri Jan 08 02:19:07 EST 2021
LINKS

W. Oberschelp, <a href="http://gdz.sub.uni-goettingen.de/dms/load/imgresolveppn/?PIDPPN=GDZPPN002298732">Kombinatorische Anzahlbestimmungen in Relationen</a>, Math. Ann., 174 (1967), 53-78.

STATUS

proposed

editing

Discussion
Fri Jan 08 02:19
Michel Marcus: better url
#59 by Jean-François Alcover at Fri Jan 08 02:12:07 EST 2021
STATUS

editing

proposed

#58 by Jean-François Alcover at Fri Jan 08 02:11:57 EST 2021
MATHEMATICA

permcount[v_] := Module[{m = 1, s = 0, k = 0, t}, For[i = 1, i <= Length[v], i++, t = v[[i]]; k = If[i > 1 && t == v[[i - 1]], k + 1, 1]; m *= t*k; s += t]; s!/m];

edges[p_] := Sum[Ceiling[(p[[i]] - 1)*((p[[i]] - 2)/6)], {i, 1, Length[p]}] + Sum[Sum[c = p[[i]]; d = p[[j]]; GCD[c, d]*(c + d - 2 + Mod[(c - d)/GCD[c, d], 2])/2 + Sum[c*d*p[[k]]/LCM[c, d, p[[k]]], {k, 1, j - 1}], {j, 1, i - 1}], {i, 2, Length[p]}];

a[n_] := Module[{s = 0}, Do[s += permcount[p]*2^edges[p], {p, IntegerPartitions[n]}]; s/n!];

a /@ Range[0, 12] (* Jean-François Alcover, Jan 08 2021, after Andrew Howroyd *)

STATUS

approved

editing

#57 by OEIS Server at Tue Aug 20 10:01:44 EDT 2019
LINKS

Alois P. Heinz, <a href="/A000665/b000665_1.txt">Table of n, a(n) for n = 0..28</a> (first 26 terms from Andrew Howroyd)

#56 by Alois P. Heinz at Tue Aug 20 10:01:44 EDT 2019
STATUS

editing

approved

Discussion
Tue Aug 20 10:01
OEIS Server: Installed new b-file as b000665.txt.  Old b-file is now b000665_1.txt.
#55 by Alois P. Heinz at Tue Aug 20 10:01:40 EDT 2019
LINKS

AndrewAlois HowroydP. Heinz, <a href="/A000665/b000665_1.txt">Table of n, a(n) for n = 0..2528</a>> (first 26 terms from Andrew Howroyd)

#54 by Alois P. Heinz at Tue Aug 20 09:15:45 EDT 2019
CROSSREFS

Column k=3 of A309858.

STATUS

approved

editing

#53 by Susanna Cuyler at Thu Dec 13 09:17:46 EST 2018
STATUS

proposed

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 August 18 07:06 EDT 2024. Contains 375255 sequences. (Running on oeis4.)