login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322251 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 3). 7
1, 1, 1, 2, 8, 32, 132, 702, 4566, 31670, 237446, 2010626, 18782106, 187594266, 2009039346, 23200862726, 286250968646, 3740867774726, 51734894498790, 756345994706634, 11641318110171330, 188004200777993570, 3180713596572408650, 56276908859288339822 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

CROSSREFS

Cf. A317111, A322262.

Sequence in context: A228921 A150829 A155084 * A150830 A150831 A084607

Adjacent sequences:  A322248 A322249 A322250 * A322252 A322253 A322254

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Nov 30 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 January 17 18:14 EST 2020. Contains 330987 sequences. (Running on oeis4.)