User:Hermann Gruber

Among other things, I have contributed

- a formula in terms of torus links (from knot theory) for sequence A051764.

- expressing the Chandah-sutra sequence (A014701) from ancient India in terms of Hamming weights

Additions of new sequences whose determination of first terms involves heavy machine calculations:

- A211931: Number of distinct regular languages over unary alphabet, whose minimum regular expression has alphabetic width n.

- A211933: Number of distinct regular languages over binary alphabet, whose minimum regular expression has alphabetic width n.

- A211934: Number of distinct finite languages over binary alphabet, whose minimum regular expression has alphabetic width n.

- A211939: Number of distinct regular languages over unary alphabet, whose minimum regular expression has reverse Polish length n.

...

Additions of new sequences along with a formula:

- A351489: Irregular triangle read by rows: T(n,k) is the minimum number of alphabetic symbols in a regular expression for the k lexicographically first palindromes of length 2*n over a binary alphabet, n >= 0, 1 <= k <= 2^n.

- A351490 Irregular triangle read by rows: T(n,k) is the minimum number of alphabetic symbols in a regular expression for the k lexicographically first palindromes of odd length 2*n-1 over a binary alphabet, n >= 1, 1 <= k <= 2^n.

- A374054: A ternary analog of the Chandah-sutra sequence. a(n) = max_{i=0..n} S_3(i) + S_3(n-i) where S_3(x) = A053735(x) is the base-3 digit sum of x.

- A374056: A base-4 analog of the Chandah-sutra sequence. a(n) = max_{i=0..n} S_4(i) + S_4(n-i) where S_4(x) = A053737(x) is the base-4 digit sum of x.

...

Further information about me can be found on my personal website hermann-gruber.com.