Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Search: a338649 -id:a338649
     Sort: relevance | references | number | modified | created      Format: long | short | data
Triangle read by rows: T(n,k) = number of divisors of n that are >= k.
+10
21
1, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 4, 3, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
OFFSET
1,2
COMMENTS
Row sums give A000203.
Left border is A000005.
LINKS
FORMULA
Triangle read by rows, partial sums of A051731 starting from the right. A051731 as a lower triangular matrix times an all 1's lower triangular matrix.
From Seiichi Manyama, Jan 07 2023: (Start)
G.f. of column k: Sum_{j>=1} x^(k*j)/(1 - x^j).
G.f. of column k: Sum_{j>=k} x^j/(1 - x^j). (End)
Sum_{j=1..n} T(j, k) ~ n * (log(n) + 2*gamma - 1 - H(k-1)), where gamma is Euler's constant (A001620), and H(k) = A001008(k)/A002805(k) is the k-th harmonic number. - Amiram Eldar, Jan 08 2024
EXAMPLE
First few rows of the triangle:
1;
2, 1;
2, 1, 1;
3, 2, 1, 1;
2, 1, 1, 1, 1;
4, 3, 2, 1, 1, 1;
2, 1, 1, 1, 1, 1, 1;
4, 3, 2, 2, 1, 1, 1, 1;
3, 2, 2, 1, 1, 1, 1, 1, 1;
4, 3, 2, 2, 2, 1, 1, 1, 1, 1;
2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1;
...
MAPLE
with(numtheory);
f1:=proc(n) local d, s1, t1, t2, i;
d:=tau(n);
s1:=sort(divisors(n));
t1:=Array(1..n, 0);
for i from 1 to d do t1[n-s1[i]+1]:=1; od:
t2:=PSUM(convert(t1, list));
[seq(t2[n+1-i], i=1..n)];
end proc;
for n from 1 to 15 do lprint(f1(n)); od: # N. J. A. Sloane, Nov 09 2018
MATHEMATICA
T[n_, k_] := DivisorSum[n, Boole[# >= k]&];
Table[T[n, k], {n, 1, 15}, {k, 1, n}] // Flatten (* Jean-François Alcover, Feb 15 2023 *)
PROG
(PARI) row(n) = my(d=divisors(n)); vector(n, k, #select(x->(x>=k), d)); \\ Michel Marcus, Jul 23 2022
KEYWORD
nonn,easy,tabl
AUTHOR
Gary W. Adamson, Oct 30 2007
EXTENSIONS
Clearer definition from N. J. A. Sloane, Nov 09 2018
STATUS
approved
Number of divisors of n which are greater than 4.
+10
8
0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 3, 1, 5, 1, 3, 2, 2, 3, 5, 1, 2, 2, 5, 1, 5, 1, 3, 4, 2, 1, 6, 2, 4, 2, 3, 1, 5, 3, 5, 2, 2, 1, 8, 1, 2, 4, 4, 3, 5, 1, 3, 2, 6, 1, 8, 1, 2, 4, 3, 3, 5, 1, 7, 3, 2, 1, 8, 3, 2, 2, 5, 1, 9, 3, 3, 2, 2, 3, 8, 1, 4, 4, 6, 1, 5, 1, 5, 6, 2, 1, 8, 1, 6
OFFSET
1,10
FORMULA
G.f.: Sum_{k>=1} x^(5*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=5} (1 - x^k)^(1/k) ).
a(n) = A000005(n) - A083040(n).
G.f.: Sum_{k>=5} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 37/12), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 4 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(5 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 5, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>4); \\ Michel Marcus, Apr 22 2021; corrected Jun 13 2022
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0], Vec(sum(k=5, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(4) prepended by David A. Corneth, Jun 13 2022
STATUS
approved
Number of divisors of n which are greater than 6.
+10
7
0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 2, 4, 1, 2, 2, 4, 1, 4, 1, 3, 3, 2, 1, 5, 2, 3, 2, 3, 1, 4, 2, 5, 2, 2, 1, 6, 1, 2, 4, 4, 2, 4, 1, 3, 2, 5, 1, 7, 1, 2, 3, 3, 3, 4, 1, 6, 3, 2, 1, 7, 2, 2, 2, 5, 1, 7, 3, 3, 2, 2, 2, 7, 1, 4, 4, 5, 1, 4, 1, 5, 5, 2, 1, 7, 1, 5
OFFSET
1,14
FORMULA
G.f.: Sum_{k>=1} x^(7*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=7} (1 - x^k)^(1/k) ).
G.f.: Sum_{k>=7} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 69/20), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 6 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(7 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 7, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>6); \\ Michel Marcus, Apr 22 2021
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0], Vec(sum(k=7, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(6) prepended by David A. Corneth, Jun 13 2022
STATUS
approved
Number of divisors of n which are greater than 7.
+10
7
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 5, 1, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 6, 1, 2, 3, 4, 2, 4, 1, 3, 2, 4, 1, 7, 1, 2, 3, 3, 2, 4, 1, 6, 3, 2, 1, 6, 2, 2, 2, 5, 1, 7, 2, 3, 2, 2, 2, 7, 1, 3, 4, 5, 1, 4, 1, 5, 4, 2, 1, 7, 1, 5
OFFSET
1,16
FORMULA
G.f.: Sum_{k>=1} x^(8*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=8} (1 - x^k)^(1/k) ).
G.f.: Sum_{k>=8} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 503/140), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 7 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(8 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 8, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>7); \\ Michel Marcus, Apr 22 2021
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0], Vec(sum(k=8, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(7) prepended by David A. Corneth, Jun 13 2022
STATUS
approved
Number of divisors of n which are greater than 8.
+10
7
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 1, 4, 1, 3, 2, 3, 1, 4, 2, 3, 2, 2, 1, 6, 1, 2, 3, 3, 2, 4, 1, 3, 2, 4, 1, 6, 1, 2, 3, 3, 2, 4, 1, 5, 3, 2, 1, 6, 2, 2, 2, 4, 1, 7, 2, 3, 2, 2, 2, 6, 1, 3, 4, 5, 1, 4, 1, 4, 4, 2, 1, 7, 1, 5
OFFSET
1,18
FORMULA
G.f.: Sum_{k>=1} x^(9*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=9} (1 - x^k)^(1/k) ).
G.f.: Sum_{k>=9} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 1041/280), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 8 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(9 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 9, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>8); \\ Michel Marcus, Apr 22 2021
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0, 0], Vec(sum(k=9, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(8) prepended by David A. Corneth, Jun 13 2022
STATUS
approved
Number of divisors of n which are greater than 9.
+10
7
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 1, 3, 2, 3, 1, 3, 2, 3, 2, 2, 1, 6, 1, 2, 2, 3, 2, 4, 1, 3, 2, 4, 1, 5, 1, 2, 3, 3, 2, 4, 1, 5, 2, 2, 1, 6, 2, 2, 2, 4, 1, 6, 2, 3, 2, 2, 2, 6, 1, 3, 3, 5, 1, 4, 1, 4, 4, 2, 1, 6, 1, 5
OFFSET
1,20
FORMULA
G.f.: Sum_{k>=1} x^(10*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=10} (1 - x^k)^(1/k) ).
G.f.: Sum_{k>=10} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 9649/2520), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 9 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(10 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 10, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>9); \\ Michel Marcus, Apr 22 2021
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0, 0, 0, 0, 0, 0], Vec(sum(k=10, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(9) prepended by David A. Corneth, Jun 13 2022
STATUS
approved
a(n) is the smallest number with exactly n divisors that are greater than or equal to 6.
+10
3
6, 12, 18, 24, 36, 48, 60, 72, 126, 192, 120, 168, 180, 252, 240, 336, 576, 3072, 360, 504, 1296, 900, 960, 1344, 720, 1008, 840, 1512, 4158, 27027, 1260, 2016, 9702, 63063, 1680, 3024, 2880, 4032, 15360, 3600, 7056, 94864, 2520, 5544, 6480, 9072, 61440, 86016
OFFSET
1,1
MATHEMATICA
Table[SelectFirst[Table[{n, Count[Divisors[n], _?(#>5&)]}, {n, 100000}], #[[2]]==k&], {k, 50}] [[;; , 1]] (* Harvey P. Dale, Jan 04 2024 *)
PROG
(PARI) a(n) = my(k=1); while (sumdiv(k, d, (d>=6)) != n, k++); k; \\ Michel Marcus, Jan 20 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 19 2023
STATUS
approved

Search completed in 0.004 seconds