The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A322598 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A322598

a(n) is the number of unlabeled rank-3 graded lattices with 3 coatoms and n atoms.
(history; published version)

#27 by Alois P. Heinz at Sat Dec 29 07:53:29 EST 2018

STATUS

proposed

approved

#26 by Jean-François Alcover at Sat Dec 29 03:58:21 EST 2018

STATUS

editing

proposed

#25 by Jean-François Alcover at Sat Dec 29 03:58:15 EST 2018

MATHEMATICA

LinearRecurrence[{1, 1, 0, -1, -1, 1}, {1, 3, 8, 13, 20, 29}, 50] (* Jean-François Alcover, Dec 29 2018 *)

STATUS

approved

editing

#24 by Bruno Berselli at Thu Dec 20 03:44:44 EST 2018

STATUS

reviewed

approved

#23 by Joerg Arndt at Thu Dec 20 03:38:38 EST 2018

STATUS

proposed

reviewed

#22 by Muniru A Asiru at Thu Dec 20 03:02:48 EST 2018

STATUS

editing

proposed

Discussion

Thu Dec 20

03:11

Michel Marcus: please next time, do not add bfile before sequence is approved (see last bullet of https://oeis.org/wiki/Style_Sheet#Links)

#21 by Muniru A Asiru at Thu Dec 20 03:02:37 EST 2018

PROG

(GAP) List([1..50], n->Int((3/4)*n^2+(1/3)*n+1/4)); # Muniru A Asiru, Dec 20 2018

STATUS

proposed

editing

#20 by Jukka Kohonen at Wed Dec 19 14:06:21 EST 2018

STATUS

editing

proposed

#19 by Jukka Kohonen at Wed Dec 19 14:06:14 EST 2018

COMMENTS

Also number of bicolored graphs, with 3 vertices in the first color class and n in the second, with no isolated vertices, and where any two vertices in one class have at most one common neighbor.

STATUS

proposed

editing

#18 by Jukka Kohonen at Wed Dec 19 11:19:18 EST 2018

STATUS

editing

proposed