This site is supported by donations to The OEIS Foundation.

# User:Matej Veselovac

From OeisWiki

Math & Computer Science hobbyist.

Consecutive k-palindromes problem: A279092 (k=2), A279093 (k=3), A308657 (k=n). Can we find a "closed form" for all such numbers, for given k?

Number formation with basic operations (+,-,*,/) problem: A142153 (non-strict), A309885 (strict), A309886 (restricted to: powers of two). Can we calculate (prove) more terms for this type of a problem, efficiently?