Loading…
revised
Recurrence for the number of permutations with a given excedance set
added 44 characters in body
Loading…
revised
Recurrence for the number of permutations with a given excedance set
added 4 characters in body
Loading…
revised
Recurrence for the A284005
added 44 characters in body
Loading…
comment
Recurrence for the A284005
@Somos, thank you for comment! I usually check up to $10^6$.
Loading…
Loading…
comment
Permutation and its binary analog
@მამუკაჯიბლაძე, I'm sorry, but I'm not a mathematician, I'm just an experimenter and I can't even figure out the definition of the map. In simple words, do you want to say that a simpler recursion is possible if we interpolate $f(n)$?
revised
Existence of binary permutations with a given property
added 57 characters in body
Loading…
revised
Existence of binary permutations with a given property
deleted 25 characters in body
Loading…
Loading…
comment
Permutation and its binary analog
@მამუკაჯიბლაძე, thank you for comment! It is Iverson brackets. If you are asking about the expression instead, then it is difficult to say why the expression looks exactly like this, because I got the whole formula as a result of experiments.
comment
Permutation and its binary analog
@ClaudeChaunier, thank you for comment! When $h(n)=0$, $n$ is Fibonacci number and $a(n)=n$. So prog really computes $g(-1)=0$, but never used this value in the computing of the result. Given permutation arise from a natural problem, see oeis.org/draft/A358733.
revised
Permutation and its binary analog
added 346 characters in body
Loading…
Loading…
revised
Permutation to get Stolarsky representation from lazy Fibonacci (dual Zeckendorf) representation
added 1 character in body
Loading…
comment
Stolarsky array and Stolarsky representation
@PeterTaylor, thank you for comment! Сould you please be a little more detailed? The definition of A200714 does not say anything about the connection with A035506, which is why the formula based on the latter (which I discovered by chance) is far from obvious to me.