Number of distinct sums d(i) + d(j) for 1<=i<=j<=n, d(k) = A000005(k) = number of divisors function.
A061794
Number of distinct sums d(i) + d(j) for 1<=i<=j<=n, d(k) = A000005(k) = number of divisors function.
Terms
- a(0) =1a(1) =3a(2) =3a(3) =5a(4) =5a(5) =7a(6) =7a(7) =7a(8) =7a(9) =7a(10) =7a(11) =10a(12) =10a(13) =10a(14) =10a(15) =11a(16) =11a(17) =11a(18) =11a(19) =11a(20) =11a(21) =11a(22) =11a(23) =14a(24) =14a(25) =14a(26) =14a(27) =14a(28) =14a(29) =14
External references
- oeis: A061794