This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
a(2) = 455 because the average number of distinct prime divisors of {1..455} is >= 2.
a(1) = 4 since the average number of prime divisors of {1..4} counted with multiplicity equals (0 + 1 + 1 + 2)/4 = 1 which is >= 1 and this is the least such number.
a(3) = 2178 because the average number of prime divisors of {1..2178} counted with multiplicity is >= 3 and this is the least such number.
s[n_] := Module[{m = 0, c = 0, k = 1, sum = 0, seq = {}}, While[c < n, sum += PrimeOmega[k]; If[sum >= m*k, c++; AppendTo[seq, k]; m++]; k++]; seq]; s[4] (* Amiram Eldar, Nov 18 2020 *)
a(n)=my(m=0,k=1);while(k>0, m+=bigomega(k); if(m>=k*n,break);k++);k \\ Derek Orr, Nov 18 2020
a(1) = 54 since the average of the number of nonunitary divisors of {1..54} is (Sum_{k=1..54} A056175(k))/54 = 1.
nd[n_] := DivisorSigma[0,n] - 2^PrimeNu[n]; seq={}; s = 0; k = 1; Do[While[s = s + nd[k]; s < k*n, k++]; AppendTo[seq, k]; k++, {n, 1, 5}]; seq
a(2) = 6 since the average number of bi-unitary divisors of {1..6} is A306069(6)/6 = 13/6 > 2.
f[p_, e_] := If[OddQ[e], e + 1, e]; bdivnum[1] = 1; bdivnum[n_] := Times @@ (f @@@ FactorInteger[n]); seq={}; s = 0; k = 1; Do[While[s = s + bdivnum[k]; s < k*n, k++]; AppendTo[seq, k]; k++, {n, 1, 10}]; seq
a(2) = 6 since the average number of infinitary divisors of {1..6} is A327573(6)/6 = 13/6 > 2.
f[p_, e_] := 2^DigitCount[e, 2, 1]; idivnum[1] = 1; idivnum[n_] := Times @@ (f @@@ FactorInteger[n]); seq={}; s = 0; k = 1; Do[While[s = s + idivnum[k]; s < k*n, k++]; AppendTo[seq, k]; k++, {n, 1, 10}]; seq
Comments