Skip to main content
MathOverflow
Notamathematician's user avatar
Notamathematician's user avatar
Notamathematician's user avatar
Notamathematician
  • Member for 3 years, 7 months
  • Last seen this week
Profile Activity

627 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
revised
Closed form for the number of steps required to get $n$ balls in the last box
added 111 characters in body
comment
Closed form for the number of steps required to get $n$ balls in the last box
@PeterTaylor, could you please improve the comment in A077071?
comment
Closed form for the number of steps required to get $n$ balls in the last box
@kodlu, thank you for comment! Done.
comment
Closed form for the number of steps required to get $n$ balls in the last box
@PeterTaylor, do you have any other questions?
revised
Closed form for the number of steps required to get $n$ balls in the last box
added 1528 characters in body
comment
Closed form for the number of steps required to get $n$ balls in the last box
@PeterTaylor, thank you for comment! Please try to write a prog (for example on PARI) and check the result. If that does not help, just tell me and I will add mine prog which most likely will make things absolutely clear.
asked
Closed form for the number of steps required to get $n$ balls in the last box
accepted
Prime numbers and number of partitions of $n$ into distinct parts with boundary size $2$
comment
Prime numbers and number of partitions of $n$ into distinct parts with boundary size $2$
@FedorPetrov, thank you for comment! Sorry, mistake was fixed. Try again now.
revised
Prime numbers and number of partitions of $n$ into distinct parts with boundary size $2$
edited body
revised
Prime numbers and number of partitions of $n$ into distinct parts with boundary size $2$
edited tags
asked
Prime numbers and number of partitions of $n$ into distinct parts with boundary size $2$
comment
Closed form for coefficients related to excedance set of permutation
@Wolfgang, thank you for comment! I am the author of this sequence. I also did a lot of work to find the simplest formula possible. I think the simplest is the variation of the Gandhi polynomials (see A357990). On the other hand, I also found a closed form alternative to the inverse binomial transformation modulo 2 (see draft for A358612). Can you suggest something even simpler?
revised
Powers of $2$ up to $2^{m-1}$ from a polynomial of degree $m-1$
edited title
accepted
Powers of $2$ up to $2^{m-1}$ from a polynomial of degree $m-1$
asked
Powers of $2$ up to $2^{m-1}$ from a polynomial of degree $m-1$
comment
Closed form for coefficients related to excedance set of permutation
@MartinRubey, thank you for comment! Number of non-zero $T(n,k)$ for a given $n$ is $\operatorname{wt}(n)+2$ where $\operatorname{wt}(n)$ is the binary weight of $n$ (OEIS A000120). Also I will try to check your first comment later.
comment
Closed form for coefficients related to excedance set of permutation
@PeterTaylor, thank you for comment! Done (also sign was fixed). Please try to compute coefficients again.
revised
Closed form for coefficients related to excedance set of permutation
added 31 characters in body
asked
Closed form for coefficients related to excedance set of permutation
1
…
20 21
22
23 24
…
32