A266226 - OEIS

%I #7 Sep 08 2022 08:46:15

%S 1,1,1,1,1,2,1,2,1,2,1,2,1,2,2,2,1,2,1,2,2,2,1,3,1,2,2,2,1,3,1,2,2,2,

%T 2,3,1,2,2,3,1,3,1,2,2,2,1,3,1,2,2,2,1,3,2,3,2,2,1,4,1,2,2,2,2,3,1,2,

%U 2,3,1,3,1,2,2,2,2,3,1,3,2,2,1,4,2,2,2,3

%N a(n) = floor(Sum_{d|n} 1 / tau(d)).

%C a(n) = floor(Sum_{d|n} 1 / A000005(d)).

%C Sequences of numbers n such that floor(Sum_{d|n} 1/tau(d)) = k for k = 1..6:

%C k=1: 1, 2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, ... (A166684);

%C k=2: 6, 8, 10, 12, 14, 15, 16, 18, 20, 21, 22, 26, 27, 28, 32, 33, 34, 35, ...;

%C k=3: 24, 30, 36, 40, 42, 48, 54, 56, 66, 70, 72, 78, 80, 88, 96, 100, ...;

%C k=4: 60, 84, 90, 120, 126, 132, 140, 144, 150, 156, 168, 198, 204, 216, ...;

%C k=5: 180, 210, 240, 252, 300, 330, 336, 360, 390, 396, 450, 462, 468, ...;

%C k=6: 420, 630, 660, 720, 780, 900, 924, 990, 1008, 1020, 1050, 1080, ....

%C See A265393 - the smallest number n such that a(n) = k for k>= 1.

%H G. C. Greubel, <a href="/A266226/b266226.txt">Table of n, a(n) for n = 1..5000</a>

%e For n = 6; a(6) = floor(Sum_{d|6} 1/tau(d)) = floor(1/1 + 1/2 + 1/2 + 1/4) = floor(9/4) = 2.

%t Table[Floor[Sum[1/DivisorSigma[0, d], {d, Divisors[ n]}]], {n, 1, 100}] (* _G. C. Greubel_, Dec 24 2015 *)

%o (Magma) [Floor(&+[1/NumberOfDivisors(d): d in Divisors(n)]): n in [1..100]]

%Y Cf. A000005, A237350, A253139, A265390, A265391, A265392, A265393

%K nonn

%O 1,6

%A _Jaroslav Krizek_, Dec 24 2015