STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A052955
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
editing
proposed
LINKS
Andrei Asinowski, Cyril Banderier, and Benjamin Hackl, <a href="https://benjamin-hackl.at/downloads/2019_ABH_popstack-extremal.pdf">On extremal cases of pop-stack sorting</a>, Permutation Patterns (Zürich, Switzerland, 2019).
Andrei Asinowski, Cyril Banderier, and Benjamin Hackl, <a href="https://arxiv.org/abs/2003.04912">Flip-sort and combinatorial aspects of pop-stack sorting</a>, arXiv:2003.04912 [math.CO], 2020.
Mohammed A. Raouf, Fazirulhisyam Hashim, Jiun Terng Liew, and Kamal Ali Alezabi, <a href="https://doi.org/10.1371/journal.pone.0237386">Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network</a>, PLoS ONE (2020) Vol. 15, No. 8, e0237386.
FORMULA
a(n) = A027383(n-1) + 1 for n>0. - _From _Hieronymus Fischer_, Sep 15 2007: (Start)
a(n) = A027383(n-1) + 1 for n>0.
a(n) = A132666(a(n+1)-1). - _Hieronymus Fischer_, Sep 15 2007
a(n) = A132666(a(n-1)) + 1 for n>0. - _Hieronymus Fischer_, Sep 15 2007
A132666(a(n)) = a(n+1) - 1. - _Hieronymus Fischer_, Sep 15 2007(End)
STATUS
proposed
editing
STATUS
editing
proposed
LINKS
Mark Shattuck, <a href="https://arxiv.org/abs/2501.09931">Further Results for the Capacity Statistic Distribution on Compositions of 1's and 2's</a>, arXiv:2501.09931 [math.CO], 2025. See p. 3.
LINKS
Mark Shattuck, <a href="https://arxiv.org/abs/2501.09931">Further Results for the Capacity Statistic Distribution on Compositions of 1's and 2's</a>, arXiv:2501.09931 [math.CO], 2025. See p. 3.
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed