The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A005251

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
newer changes | Showing entries 11-20 | older changes

A005251

a(0) = 0, a(1) = a(2) = a(3) = 1; thereafter, a(n) = a(n-1) + a(n-2) + a(n-4).
(history; published version)

#288 by Joerg Arndt at Wed Jan 31 02:51:56 EST 2024

STATUS

proposed

#287 by Michel Marcus at Wed Jan 31 02:19:09 EST 2024

STATUS

editing

#286 by Michel Marcus at Wed Jan 31 02:19:04 EST 2024

LINKS

J.-L. Baril, <a href="https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2343.1.html">Avoiding patterns in irreducible permutations</a>, Discrete Mathematics and Theoretical Computer Science, Vol 17, No 3 (2016). See Table 4.

STATUS

approved

#285 by Michael De Vlieger at Fri Dec 22 12:10:47 EST 2023

STATUS

reviewed

#284 by Michel Marcus at Fri Dec 22 12:06:10 EST 2023

STATUS

proposed

#283 by Michael De Vlieger at Fri Dec 22 11:16:05 EST 2023

STATUS

editing

#282 by Michael De Vlieger at Fri Dec 22 11:16:02 EST 2023

LINKS

STATUS

approved

#281 by Alois P. Heinz at Tue Jul 18 10:41:34 EDT 2023

STATUS

proposed

#280 by Michel Marcus at Tue Jul 18 09:25:55 EDT 2023

STATUS

editing

#279 by Michel Marcus at Tue Jul 18 09:25:48 EDT 2023

LINKS

T. Mansour and M. Shattuck, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Shattuck/shattuck3.html">Counting Peaks and Valleys in a Partition of a Set </a>, J. Int. Seq. 13 (2010), 10.6.8, Lemma 2.1, k=2, 0 peaks.

STATUS

approved