cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A177481 Number of permutations of order n avoiding the consecutive pattern efgh with e

Original entry on oeis.org

1, 1, 2, 6, 20, 80, 404, 2368, 15488, 114480, 948992, 8625672, 85223792, 913869056, 10567326528, 130796711016, 1726077013456, 24213357455936, 359694651093152, 5638959807231240, 93052021458248400, 1612444736747193696, 29271726199933801536, 555518182602741687432, 11001032351303890637648
Offset: 0

Views

Author

Signy Olafsdottir (signy06(AT)ru.is), May 09 2010

Keywords

Comments

To avoid efgh means not to have four consecutive letters such that the first and the third letters are less than the second and the fourth letters.

Crossrefs

Programs

  • Mathematica
    ok[{e_,f_,g_,h_}] := e>f || e>h || g>f || g>h; a[n_] := Length@ Select[ Permutations[ Range@ n], AllTrue[ Partition[#, 4, 1], ok] &]; Array[a, 9, 0] (* Giovanni Resta, Mar 11 2020 *)

Extensions

a(0), a(10)-a(16) from Giovanni Resta, Mar 11 2020
Edited and a(17)-a(24) added by Max Alekseyev, Oct 01 2024