A092405
a(n) = tau(n) + tau(n+1), where tau(n) = A000005(n), the number of divisors of n.
Original entry on oeis.org
3, 4, 5, 5, 6, 6, 6, 7, 7, 6, 8, 8, 6, 8, 9, 7, 8, 8, 8, 10, 8, 6, 10, 11, 7, 8, 10, 8, 10, 10, 8, 10, 8, 8, 13, 11, 6, 8, 12, 10, 10, 10, 8, 12, 10, 6, 12, 13, 9, 10, 10, 8, 10, 12, 12, 12, 8, 6, 14, 14, 6, 10, 13, 11, 12, 10, 8, 10, 12, 10, 14, 14, 6, 10, 12, 10, 12, 10, 12, 15, 9, 6, 14, 16
Offset: 1
-
Total /@ Partition[Array[DivisorSigma[0, #] &, 85], 2, 1] (* Michael De Vlieger, Sep 18 2018 *)
-
for(i=1,60,print1(","sigma(i,0)+sigma(i+1,0)))
-
A092405(n) = (numdiv(n)+numdiv(1+n)); \\ Antti Karttunen, Oct 07 2017
A340584
Irregular triangle read by rows T(n,k) in which row n lists sigma(n) + sigma(n-1) together with the first n - 2 terms of A000203 in reverse order, with T(1,1) = 1, n >= 1.
Original entry on oeis.org
1, 4, 7, 1, 11, 3, 1, 13, 4, 3, 1, 18, 7, 4, 3, 1, 20, 6, 7, 4, 3, 1, 23, 12, 6, 7, 4, 3, 1, 28, 8, 12, 6, 7, 4, 3, 1, 31, 15, 8, 12, 6, 7, 4, 3, 1, 30, 13, 15, 8, 12, 6, 7, 4, 3, 1, 40, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1, 42, 12, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1, 38, 28, 12, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1
Offset: 1
Triangle begins:
1;
4;
7, 1;
11, 3, 1;
13, 4, 3, 1;
18, 7, 4, 3, 1;
20, 6, 7, 4, 3, 1;
23, 12, 6, 7, 4, 3, 1;
28, 8, 12, 6, 7, 4, 3, 1;
31, 15, 8, 12, 6, 7, 4, 3, 1;
30, 13, 15, 8, 12, 6, 7, 4, 3, 1;
40, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1;
42, 12, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1;
38, 28, 12, 18, 13, 15, 8, 12, 6, 7, 4, 3, 1;
...
For n = 7, sigma(7) = 1 + 7 = 8 and sigma(6) = 1 + 2 + 3 + 6 = 12, and 8 + 12 = 20, so the first term of row 7 is T(7,1) = 20. The other terms in row 7 are the first five terms of A000203 in reverse order, that is [6, 7, 4, 3, 1] so the 7th row of the triangle is [20, 6, 7, 4, 3, 1].
From _Omar E. Pol_, Jul 11 2021: (Start)
For n = 7 we can see below the top view and the lateral view of the pyramid described in A245092 (with seven levels) and the top view and the lateral view of the tower described in A221529 (with 11 levels).
_
| |
| |
| |
_ |_|_
|_|_ | |
|_ _|_ |_ _|_
|_ _|_|_ | | |
|_ _ _| |_ |_ _|_|_
|_ _ _|_ _|_ |_ _ _| |_
|_ _ _ _| | |_ |_ _ _|_ _|_ _
|_ _ _ _|_|_ _| |_ _ _ _|_|_ _|
.
Figure 1. Figure 2.
Lateral view Lateral view
of the pyramid. of the tower.
.
. _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_| | | | | | | |_| | | | | |
|_ _|_| | | | | |_ _|_| | | |
|_ _| _|_| | | |_ _| _|_| |
|_ _ _| _|_| |_ _ _| _ _|
|_ _ _| _| |_ _ _| _|
|_ _ _ _| | |
|_ _ _ _| |_ _ _ _|
.
Figure 3. Figure 4.
Top view Top view
of the pyramid. of the tower.
.
Both polycubes have the same base which has an area equal to A024916(7) = 41 equaling the sum of the 7th row of triangle.
Note that in the top view of the tower the symmetric representation of sigma(6) and the symmetric representation of sigma(7) appear unified in the level 1 of the structure as shown above in the figure 4 (that is due to the first two partition numbers A000041 are [1, 1]), so T(7,1) = sigma(7) + sigma(6) = 8 + 12 = 20. (End)
The length of row n is
A028310(n-1).
Column 1 gives 1 together with
A092403.
Cf.
A175254 (volume of the pyramid).
-
Table[If[n <= 2, {Total@ #}, Prepend[#2, Total@ #1] & @@ TakeDrop[#, 2]] &@ DivisorSigma[1, Range[n, 1, -1]], {n, 14}] // Flatten (* Michael De Vlieger, Jan 13 2021 *)
A346533
Irregular triangle read by rows in which row n lists the first n - 2 terms of A000203 together with the sum of A000203(n-1) and A000203(n), with a(1) = 1.
Original entry on oeis.org
1, 4, 1, 7, 1, 3, 11, 1, 3, 4, 13, 1, 3, 4, 7, 18, 1, 3, 4, 7, 6, 20, 1, 3, 4, 7, 6, 12, 23, 1, 3, 4, 7, 6, 12, 8, 28, 1, 3, 4, 7, 6, 12, 8, 15, 31, 1, 3, 4, 7, 6, 12, 8, 15, 13, 30, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 40, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 42, 1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 38
Offset: 1
Triangle begins:
1;
4;
1, 7;
1, 3, 11;
1, 3, 4, 13;
1, 3, 4, 7, 18;
1, 3, 4, 7, 6, 20;
1, 3, 4, 7, 6, 12, 23;
1, 3, 4, 7, 6, 12, 8, 28;
1, 3, 4, 7, 6, 12, 8, 15, 31;
1, 3, 4, 7, 6, 12, 8, 15, 13, 30;
1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 40;
1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 42;
1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 38;
...
For n = 7, sigma(7) = 1 + 7 = 8 and sigma(6) = 1 + 2 + 3 + 6 = 12, and 8 + 12 = 20, so the last term of row 7 is T(7,6) = 20. The other terms in row 7 are the first five terms of A000203, so the 7th row of the triangle is [1, 3, 4, 7, 6, 20].
For n = 7 we can see below the top view and the lateral view of the pyramid described in A245092 (with seven levels) and the top view and the lateral view of the tower described in A221529 (with 11 levels).
_
| |
| |
| |
_ |_|_
|_|_ | |
|_ _|_ |_ _|_
|_ _|_|_ | | |
|_ _ _| |_ |_ _|_|_
|_ _ _|_ _|_ |_ _ _| |_
|_ _ _ _| | |_ |_ _ _|_ _|_ _
|_ _ _ _|_|_ _| |_ _ _ _|_|_ _|
.
Figure 1. Figure 2.
Lateral view Lateral view
of the pyramid. of the tower.
.
. _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_| | | | | | | |_| | | | | |
|_ _|_| | | | | |_ _|_| | | |
|_ _| _|_| | | |_ _| _|_| |
|_ _ _| _|_| |_ _ _| _ _|
|_ _ _| _| |_ _ _| _|
|_ _ _ _| | |
|_ _ _ _| |_ _ _ _|
.
Figure 3. Figure 4.
Top view Top view
of the pyramid. of the tower.
.
Both polycubes have the same base which has an area equal to A024916(7) = 41 equaling the sum of the 7th row of triangle.
Note that in the top view of the tower the symmetric representation of sigma(6) and the symmetric representation of sigma(7) appear unified in the level 1 of the structure as shown above in the figure 4 (that is due the first two partition numbers A000041 are [1, 1]), so T(7,6) = sigma(7) + sigma(6) = 8 + 12 = 20.
.
Illustration of initial terms:
Row 1 Row 2 Row 3 Row 4 Row 5 Row 6
.
1 4 1 7 1 3 11 1 3 4 13 1 3 4 7 18
. _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
|_| | | |_| | |_| | | |_| | | | |_| | | | |
|_ _| | _| |_ _| | |_ _|_| | |_ _|_| | |
|_ _| | _| |_ _| _ _| |_ _| _| |
|_ _ _| | | |_ _ _| _|
|_ _ _| | _|
|_ _ _ _|
.
The length of row n is
A028310(n-1).
Cf.
A175254 (volume of the pyramid).
Cf.
A000041,
A221529,
A237270,
A237593,
A245092,
A245093 (similar),
A336811,
A336812,
A338156,
A339106,
A340035.
-
A346533row[n_]:=If[n==1,{1},Join[DivisorSigma[1,Range[n-2]],{Total[DivisorSigma[1,{n-1,n}]]}]];Array[A346533row,15] (* Paolo Xausa, Oct 23 2023 *)
A227306
Numbers k that divide sigma(k) + sigma(k-1).
Original entry on oeis.org
2, 6, 34, 50, 216, 236, 262, 386, 898, 924, 945, 1456, 2380, 5356, 6468, 6624, 8362, 14100, 23496, 26938, 46594, 80876, 196344, 212796, 1661136, 4070200, 4160920, 4626700, 5244548, 5462384, 17062316, 60464628, 217408416, 248621604, 262792908, 265371336, 323987588
Offset: 1
-
With[{nn=324*10^6},Select[Thread[{Total/@Partition[DivisorSigma[ 1,Range[ nn]],2,1],Range[ 2,nn]}],Divisible[#[[1]],#[[2]]]&][[All,2]]] (* Harvey P. Dale, May 29 2020 *)
A067282
Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).
Original entry on oeis.org
1, 5, 52, 55, 185, 506, 551, 590, 644, 667, 707, 2285, 2587, 2758, 7551, 10366, 11336, 11564, 11798, 12750, 16616, 16703, 16764, 17383, 18239, 24350, 24415, 26586, 33263, 35541, 40382, 63248, 76247, 76622, 92379, 95069, 97341, 106312, 111388
Offset: 1
-
Select[Range[120000], Divisible[DivisorSigma[1, #] + DivisorSigma[1, # + 1], EulerPhi[#] + EulerPhi[# + 1]] &] (* Amiram Eldar, Mar 02 2020 *)
Select[Partition[Table[{n,EulerPhi[n],DivisorSigma[1,n]},{n,111400}],2,1], Divisible[ #[[1,3]]+#[[2,3]],#[[1,2]]+#[[2,2]]]&][[All,1,1]] (* Harvey P. Dale, Apr 25 2020 *)
A252922
a(n) = sigma(n-1) + sigma(n-2) + sigma(n-3), with a(1)=0, a(2)=1, a(3)=4.
Original entry on oeis.org
0, 1, 4, 8, 14, 17, 25, 26, 35, 36, 46, 43, 58, 54, 66, 62, 79, 73, 88, 77, 101, 94, 110, 92, 120, 115, 133, 113, 138, 126, 158, 134, 167, 143, 165, 150, 193, 177, 189, 154, 206, 188, 228, 182, 224, 206, 234, 198, 244, 229, 274, 222, 263, 224, 272, 246, 312, 272, 290, 230, 318, 290, 326, 262, 327, 315, 355, 296
Offset: 1
a(5) = sigma(4) + sigma(3) + sigma(2) = 7 + 4 + 3 = 14. On the other hand a(5) = A024916(4) - A024916(1) = 15 - 1 = 14.
...
Also, if written as a rectangular array T(j,k) with four columns the sequence begins:
0, 1, 4, 8;
14, 17, 25, 26;
35, 36, 46, 43;
58, 54, 66, 62;
79, 73, 88, 77;
101, 94, 110, 92;
120, 115, 133, 113;
138, 126, 158, 134;
167, 143, 165, 150;
193, 177, 189, 154;
206, 188, 228, 182;
224, 206, 234, 198;
244, 229, 274, 222;
263, 224, 272, 246;
312, 272, 290, 230;
318, 290, 326, 262;
...
In this case T(2,1) = a(5) = 14.
Cf.
A000203,
A010883,
A024916,
A092403,
A112610,
A193553,
A196020,
A236104,
A237270,
A237271,
A237593,
A239052,
A239053,
A239931-
A239934,
A239660,
A240020,
A244050,
A245092,
A262626.
-
L:= [0,0,0,seq(numtheory:-sigma(n), n=1..100)]:
L[1..101]+L[2..102]+L[3..103]; # Robert Israel, Dec 07 2016
-
a252922[n_] := Block[{f}, f[1] = 0; f[2] = 1; f[3] = 4;
f[x_] := DivisorSigma[1, x - 1] + DivisorSigma[1, x - 2] +
DivisorSigma[1, x - 3]; Table[f[i], {i, n}]]; a252922[68] (* Michael De Vlieger, Dec 27 2014 *)
-
v=concat([0,1,4],vector(100,n,sigma(n)+sigma(n+1)+sigma(n+2))) \\ Derek Orr, Dec 30 2014
A348335
a(n) = smallest k such that the sum of the divisors of the n numbers from k to k+n-1 equals sigma(k+n), or -1 if no such k exists.
Original entry on oeis.org
a(1) = 14 because sigma(14) = sigma(15) = 24; a(1) = A002961(1).
a(2) = 1 because sigma(1) + sigma(2) = 1 + 3 = 4, the same as sigma(3) = 4; a(2) = A104149(1).
a(3) = 591357 because sigma(591357) + sigma(591358) + sigma(591359) = 866880 + 890352 + 599760 = 2356992, the same as sigma(591360) = 2356992.
-
a[n_] := Module[{sig = DivisorSigma[1, Range[n]], k = n + 1}, While[(s = DivisorSigma[1, k]) != Plus @@ sig, sig = Join[Drop[sig, 1], {s}]; k++]; k - n]; Array[a, 3] (* Amiram Eldar, Oct 29 2021 *)
-
isok(m, nb) = sum(i=1, nb, sigma(m+i-1)) == sigma(m+nb);
a(n) = my(k=1); while (!isok(k, n), k++); k; \\ Michel Marcus, Oct 28 2021
Showing 1-7 of 7 results.
Comments