First solution
We shall firstly prove the following lemmas,
Lemma 1. If x is interesting and y<x then xy is also interesting.
Proof. If n<xy, by division algorithm we have n=yq+r where q<x, r<y. Now, we can write q=∑di and r=∑di′ where {di} and {di′} are distinct divisors of x. Now diy, di′ are distinct divisors of xy and n=∑diy+∑di′.
Lemma 2. For i∈N, 2i is an interesting number.
Proof. It is clear by writing n<2i in the basis 2.
Let P(x)=x2+x+2022. If n is an interesting number and n∣P(x0), then n∣P(r) where r is the remainder of x0 modulo n. If n>2022,
P(r)≤(x−1)2+x−1+2022<x2,
which implies that P(r) is an interesting number. So, it is enough to find a sequence ni so that 2i∣P(ni). To do this we use induction, assume that 2i∣P(ni) then
P(ni+k2i)=(n+k2i)2+ni+ki+2022≡P(ni)+k2i(mod2i+1)
So it is enough to set k=−2iP(ni).
Second solution
Here we provide a slightly different solution. Let p1<p2<⋯<pk be distinct prime numbers and let α1,…,αk be non-negative integers. If m=p1α1…ptαt, m is an interesting number if and only if p1=2 and pj−1≤σ(p1α1…pj−1αj−1) for 1<j≤k. Let NM be the total number of integers n such that can be written in the form ∑d where d are distinct divisors of M. It is clear that NM≤σ(M). For a given set S of integers M define S∗ to be the subset of S containing integers such that σ(M)−NM is minimal.
Let M be an interesting number and p be a prime number such that gcd(p,M)=1 then M1=pkM is interesting if and only if p≤σ(M)+1.
The smallest divisor of M1 not a divisor of M is p. If p>σ(M)+1 then n=1+σ(M) defies the representation with respect to M1. If p≤σ(M)+1, we show by induction that pk≤σ(pk−1M)+1. The base, i.e., k=1 is true. Using the induction hypothesis on k, we have
pk+1≤pσ(pk−1M)+p≤pσ(pk−1M)+σ(M)+1=σ(pkM)+1.
This shows that M1=pkM is interesting. Considering the intervals from rpk to rpk+σ(pk−1M), r=0,1,…,σ(M). It follows that no integer in the range 1≤n≤σ(M1) is omitted from all these intervals. For the one hand, because pk≤σ(pk−1M)+1 we have (r+1)pk≤rpk+σ(pk−1M)+1. Hence, intervals are overlapping or contiguous. On the other hand the intervals include 1 and pkσ(M)+σ(pk−1M)=σ(M1). Thus, such n can be written as
n=rpk+s,0≤r≤σ(M),0≤s≤σ(pk−1M).
Since M, pk−1M are interesting we can write r=Σd where d are distinct divisors of M and we can write s=ΣD where D are distinct divisors of pk−1M. That is, n=Σd′+ΣD. Where d′=pkd are distinct from D because of involving pk. While both d′, D dividing M1.
If m is interesting and 1≤n≤1+σ(m) then mn is interesting. In part, mn is interesting for all 1≤n≤2m. Since m−1 is sum of divisors of m, we have m+(m−1)≤σ(m).
Let f(n)=n2+bn+c then f(n+f(n))=f(n)f(n+1). Notice that f(n+1)=f(n)+2n+b+1 and f(n)−2n−b−1=n(n−2)+b(n−1)+c−1≥0. If n≥2 is an integer with f(n) an interesting number then f(n+f(n)) would also be interesting. Because, f(n+1)≤2f(n).
Finally, we need to find at least one interesting number. Indeed, since 2024=8×11×23, we find that 8 and 8×11 are both interesting. Further, since 2×8×11≥23 it follows that 2024=8⋅11⋅23 is also interesting. Now, letting f(n)=n2+n+2023 take a1=1 and ai+1=ai+f(ai), i=1,2,… and according to the above facts, we are done. ■