Certain combinatoric convolution sums arising from bernoulli and euler polynomials

Abstract

In this study, we introduce the absolute Mobius divisor function U (n). According to some numerical computational evidence, we consider integer pairs (n, n + 1) satisfying; phi (n) = phi (n + 1) = U (n) = U (n + 1). Furthermore, we give some examples and proofs for our results.