This site is supported by donations to The OEIS Foundation.
User:Robert Dougherty-Bliss
From OeisWiki
I'm a graduate student in the math department at Rutgers University (New Brunswick).
I like to explore and solve problems with computers.
Sequences where computers were helpful
- A326344. Bizarre sequence that seems bounded. Turns out to be bounded, and "computational" proof is the only known method.
Sequences I would like to understand
- A333517. Number of "divisor partitions" of {1, 2, ..., n}. Closed form? Asymptotics? Smallest number of parts for each n?
- A320430. Counts the number of "coprime partitions." Kind of the opposite of the above.
- A327701. Maximum value of "base-k" variants of A326344. Are those variants all bounded?
Homepage: https://rwdb.xyz/