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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A317444 Number of permutations of [n] whose lengths of increasing runs are distinct Fibonacci numbers. 6
 1, 1, 1, 5, 6, 19, 212, 40, 757, 2170, 13546, 379084, 8978, 73195, 2702092, 772852, 38833826, 213557110, 2390871412, 150689939006, 9394670, 634504029, 4522073096, 63395566566, 5160905755362, 192831696582, 3068824154606, 289158899744046, 116561588867106 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..150 MAPLE g:= (n, s)-> `if`(n in s or not     (issqr(5*n^2+4) or issqr(5*n^2-4)), 0, 1): b:= proc(u, o, t, s) option remember; `if`(u+o=0, g(t, s),       `if`(g(t, s)=1, add(b(u-j, o+j-1, 1, s union {t})        , j=1..u), 0)+ add(b(u+j-1, o-j, t+1, s), j=1..o))     end: a:= n-> b(n, 0\$2, {}): seq(a(n), n=0..30); CROSSREFS Cf. A000045, A317128, A317445, A317446, A317447, A317448. Sequence in context: A056509 A129722 A133608 * A072577 A231182 A231181 Adjacent sequences:  A317441 A317442 A317443 * A317445 A317446 A317447 KEYWORD nonn AUTHOR Alois P. Heinz, Jul 28 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.

Last modified September 18 09:22 EDT 2020. Contains 337166 sequences. (Running on oeis4.)