login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #6 Dec 02 2018 08:51:48

%S 1,1,1,2,8,32,132,702,4566,31670,237446,2010626,18782106,187594266,

%T 2009039346,23200862726,286250968646,3740867774726,51734894498790,

%U 756345994706634,11641318110171330,188004200777993570,3180713596572408650,56276908859288339822

%N Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 3).

%H Alois P. Heinz, <a href="/A322251/b322251.txt">Table of n, a(n) for n = 0..470</a>

%Y Cf. A317111, A322262.

%K nonn

%O 0,4

%A _Alois P. Heinz_, Nov 30 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)