login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322276 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 5). 6
1, 1, 1, 1, 1, 2, 12, 72, 352, 1472, 5756, 26336, 180116, 1577006, 13720566, 109776526, 829240726, 6488348726, 59134377126, 640605185526, 7502207070150, 87309498759810, 989782736128170, 11277397727184650, 136523328121058170, 1817775858886701082 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..501

CROSSREFS

Cf. A317111, A322251, A322262.

Sequence in context: A009552 A002670 A119921 * A279154 A167747 A018931

Adjacent sequences:  A322273 A322274 A322275 * A322277 A322278 A322279

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Dec 01 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 17:03 EST 2019. Contains 330000 sequences. (Running on oeis4.)