Sum of Elevisors

Problem Statement

Given a set $E$ of positive integers, an element $x$ of $E$ is called an element divisor (elevisor) of $E$ if $x$ divides another element of $E$.

The sum of all elevisors of $E$ is denoted $\operatorname{sev}(E)$.
For example, $\operatorname{sev}(\{1, 2, 5, 6\}) = 1 + 2 = 3$.

Let $S(n)$ be the sum of $\operatorname{sev}(E)$ for all subsets $E$ of $\{1, 2, \dots, n\}$.
You are given $S(10) = 4927$.

Find $S(2^N) \bmod 1234567891$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 icy
80.00 (100)
🥈 shs10978
80.00 (80)
🥉 jonnytang
1.00 (1)

Data

Stats

Your submissions will appear here

Recent Submissions

1
icy
$g(100)$, $10$ digits 3 weeks, 4 days ago
2
icy
$g(99)$, $9$ digits 3 weeks, 4 days ago
3
icy
$g(98)$, $9$ digits 3 weeks, 4 days ago
4
icy
$g(97)$, $10$ digits 3 weeks, 4 days ago
5
icy
$g(96)$, $10$ digits 3 weeks, 4 days ago