Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
reviewed
approved
proposed
reviewed
editing
proposed
R. Cori and G. Hetyei, <a href="httphttps://www.dmtcsdoi.org/10.46298/dmtcs-ojs/index.php/proceedings/article/viewFile/dmAT0130/44882404">How to count genus one partitions</a>, FPSAC 2014, Chicago, Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France, 2014, 333-344.
approved
editing
proposed
approved
editing
proposed
R. Cori, and G. Hetyei, <a href="http://arxiv.org/abs/1306.4628">Counting genus one partitions and permutations</a>, arXiv preprint arXiv:1306.4628 [math.CO], 2013.
R. Cori, and G. Hetyei, <a href="http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/viewFile/dmAT0130/4488">How to count genus one partitions</a>, FPSAC 2014, Chicago, Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France, 2014, 333-344.
S. Kitaev, and J. Remmel, <a href="http://arxiv.org/abs/1503.00914">p-Ascent Sequences</a>, arXiv preprint arXiv:1503.00914 [math.CO], 2015.
Sergey Kitaev & and Jeffrey Remmel, <a href="https://pure.strath.ac.uk/portal/files/46917816/Kitaev_Remmel_JC2016_a_note_on_p_ascent_sequences
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed