A341526 -id:A341526 - cp's OEIS frontend

A341626 Square array A(n,k) = A341526(A246278(n,k)), read by falling antidiagonals; Numerators of the columnwise first quotients of A341605/A341606.

8, 52, 9, 4, 279, 20, 64, 6, 1425, 21, 160, 1053, 10, 343, 77, 26, 189, 12500, 49, 22143, 117, 28, 372, 110, 62769, 33, 51883, 170, 1936, 231, 4275, 351, 791945, 130, 110109, 114, 248, 5751, 780, 2401, 6545, 573417, 68, 199633, 115, 1040, 2565, 1750625, 595, 199287, 13338, 1778506, 57, 460759, 464

Offset: 1

Antti Karttunen, Feb 16 2021

See comments in A341605.

			The top left corner of the array:
   n =  1       2    3        4      5        6      7             8        9
  2n =  2       4    6        8     10       12     14            16       18
----+--------------------------------------------------------------------------
  1 |   8,     52,   4,      64,   160,      26,    28,         1936,     248,
  2 |   9,    279,   6,    1053,   189,     372,   231,         5751,    2565,
  3 |  20,   1425,  10,   12500,   110,    4275,   780,      1750625,     980,
  4 |  21,    343,  49,   62769,   351,    2401,   595,     38668105,    6039,
  5 |  77,  22143,  33,  791945,  6545,  199287,  1463,    453007181,  307307,
  6 | 117,  51883, 130,  573417, 13338,  518830, 13455,   2534531701,  757809,
  7 | 170, 110109,  68, 1778506,  9775,  660654, 15776,  11489232281, 1786190,
  8 | 114, 199633,  57, 2181162, 17632,  998165, 33573,  38126842081, 2283762,
  9 | 115, 460759,  92, 5122307, 67735, 7372144, 89355, 204995005981, 3311655,
etc.

Cf. A246278, A341605, A341606, A341526.

Cf. A341627 (denominators).

up_to = 105;
A246278sq(row,col) = if(1==row,2*col, my(f = factor(2*col)); for(i=1, #f~, f[i,1] = prime(primepi(f[i,1])+(row-1))); factorback(f));
A341626sq(row,col) = A341526(A246278sq(row,col));
A341626list(up_to) = { my(v = vector(up_to), i=0); for(a=1,oo, for(col=1,a, i++; if(i > up_to, return(v)); v[i] = A341626sq(col,(a-(col-1))))); (v); };
v341626 = A341626list(up_to);
A341626(n) = v341626[n];

A(n,k) = A341526(A246278(n,k)).
If we set r(row,col) = A341605(row,col)/A341606(row,col) and d(row,col) = A(row,col)/A341627(row,col), then d(row,col) = r(row+1,col)/r(row,col).
For all n, k, A(n,k) < A341627(n, k).

A246278 Prime shift array: Square array read by antidiagonals: A(1,col) = 2*col, and for row > 1, A(row,col) = A003961(A(row-1,col)).

Original entry on oeis.org

2, 4, 3, 6, 9, 5, 8, 15, 25, 7, 10, 27, 35, 49, 11, 12, 21, 125, 77, 121, 13, 14, 45, 55, 343, 143, 169, 17, 16, 33, 175, 91, 1331, 221, 289, 19, 18, 81, 65, 539, 187, 2197, 323, 361, 23, 20, 75, 625, 119, 1573, 247, 4913, 437, 529, 29, 22, 63, 245, 2401, 209, 2873, 391, 6859, 667, 841, 31

Offset: 2

Antti Karttunen, Aug 21 2014

The array is read by antidiagonals: A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.
This array can be obtained by taking every second column from array A242378, starting from its column 2.
Permutation of natural numbers larger than 1.
The terms on row n are all divisible by n-th prime, A000040(n).
Each column is strictly growing, and the terms in the same column have the same prime signature.
A055396(n) gives the row number of row where n occurs,
and A246277(n) gives its column number, both starting from 1.
From Antti Karttunen, Jan 03 2015: (Start)
A252759(n) gives their sum minus one, i.e. the Manhattan distance of n from the top left corner.
If we assume here that a(1) = 1 (but which is not explicitly included because outside of the array), then A252752 gives the inverse permutation. See also A246276.
(End)

			The top left corner of the array:
   2,     4,     6,     8,    10,    12,    14,    16,    18, ...
   3,     9,    15,    27,    21,    45,    33,    81,    75, ...
   5,    25,    35,   125,    55,   175,    65,   625,   245, ...
   7,    49,    77,   343,    91,   539,   119,  2401,   847, ...
  11,   121,   143,  1331,   187,  1573,   209, 14641,  1859, ...
  13,   169,   221,  2197,   247,  2873,   299, 28561,  3757, ...

Antti Karttunen, Table of n, a(n) for n = 2..1276; the first 50 antidiagonals of the array

First row: A005843 (the even numbers), from 2 onward.
Row 2: A249734, Row 3: A249827.
Column 1: A000040 (primes), Column 2: A001248 (squares of primes), Column 3: A006094 (products of two successive primes), Column 4: A030078 (cubes of primes).
Transpose: A246279.
Inverse permutation: A252752.
One more than A246275.
Cf. A005940, A242378, A246259, A000040, A002260, A004736, A003961, A055396, A083221, A114537, A246277 (terms of A348717 halved), A246675, A246684, A249818, A252759, A253515.
Arrays obtained by applying a particular function (given in parentheses) to the entries of this array. Cases where the columns grow monotonically are indicated with *: A249822 (A078898), A253551 (* A156552), A253561 (* A122111), A341605 (A017665), A341606 (A017666), A341607 (A006530 o A017666), A341608 (A341524), A341626 (A341526), A341627 (A341527), A341628 (A006530 o A341527), A342674 (A341530), A344027 (* A003415, arithmetic derivative), A355924 (A342671), A355925 (A009194), A355926 (A355442), A355927 (* sigma), A356155 (* A258851), A372562 (A252748), A372563 (A286385), A378979 (* deficiency, A033879), A379008 (* (probably), A294898), A379010 (* A000010, Euler phi), A379011 (* A083254).
Cf. A329050 (subtable).

f[p_?PrimeQ] := f[p] = Prime[PrimePi@ p + 1]; f[1] = 1; f[n_] := f[n] = Times @@ (f[First@ #]^Last@ # &) /@ FactorInteger@ n; Block[{lim = 12}, Table[#[[n - k, k]], {n, 2, lim}, {k, n - 1, 1, -1}] &@ NestList[Map[f, #] &, Table[2 k, {k, lim}], lim]] // Flatten (* Michael De Vlieger, Jan 04 2016, after Jean-François Alcover at A003961 *)

(define (A246278 n) (if (<= n 1) n (A246278bi (A002260 (- n 1)) (A004736 (- n 1))))) ;; Square array starts with offset=2, and we have also tacitly defined a(1) = 1 here.
(define (A246278bi row col) (if (= 1 row) (* 2 col) (A003961 (A246278bi (- row 1) col))))

A(1,col) = 2*col, and for row > 1, A(row,col) = A003961(A(row-1,col)).
As a composition of other similar sequences:
a(n) = A122111(A253561(n)).
a(n) = A249818(A083221(n)).
For all n >= 1, a(n+1) = A005940(1+A253551(n)).
A(n, k) = A341606(n, k) * A355925(n, k). - Antti Karttunen, Jul 22 2022

Starting offset of the linear sequence changed from 1 to 2, without affecting the column and row indices by Antti Karttunen, Jan 03 2015

A341529 a(n) = sigma(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of the divisors of n.

Original entry on oeis.org

1, 9, 20, 63, 42, 180, 88, 405, 325, 378, 156, 1260, 238, 792, 840, 2511, 342, 2925, 460, 2646, 1760, 1404, 696, 8100, 1519, 2142, 5000, 5544, 930, 7560, 1184, 15309, 3120, 3078, 3696, 20475, 1558, 4140, 4760, 17010, 1806, 15840, 2068, 9828, 13650, 6264, 2544, 50220, 6897, 13671, 6840, 14994, 3186, 45000, 6552, 35640

Offset: 1

Antti Karttunen, Feb 16 2021

Question: Does the maximum value of ratio A341529(n)/A341528(n) stay below 2?
From Amiram Eldar and Antti Karttunen, Jan 28 2023: (Start)
Answer to the above question is yes: Sup_{n>=1} A341529(n)/A341528(n) = 2.
Proof:
  f(n) = A341529(n)/A341528(n) is a multiplicative function with f(p^e) = (1 + 1/p + ... + 1/p^e)/(1 + 1/q + ... + 1/q^e), where q = nextprime(p).
  First we prove a lemma which states that f(p^(1+e)) / f(p^e) > 1, for any prime p, and exponent e.
  We note that (sigma(p^(1+e))/(p^(1+e))) / (sigma(p^e)/(p^e)) = (sigma(p^(1+e))/(p*sigma(p^e))) = sigma(p^(1+e)) / (sigma(p^(1+e)) - 1), so setting q = nextprime(p), we can write the ratio f(p^(1+e)) / f(p^e) as (sigma(p^(1+e))/(sigma(p^(1+e))-1)) / (sigma(q^(1+e))/(sigma(q^(1+e))-1)), and to prove this to be > 1, we just note that the denominator is less than the numerator, because sigma(p^e) is monotonically growing with respect to the increasing prime p.
  Since q > p, we have f(p^e) > 1 for all p and all e>=1, and together with the above lemma this shows that f(n) <= f(n*m) for all m>=1.
  Suppose n = Product_i p_i^e_i, and let pmax = max(p_i), emax = max(e_i), so n is a divisor of m = (pmax#)^emax, and f(n) < f(m), where p# = 2 * 3 * ... * p is the primorial of p, A034386(p).
  Then f(m) = f(2^emax) * f(3^emax) * ... * f(pmax^emax) = (1 + 1/2 + ... + 1/2^emax)/(1 + 1/3 + ... + 1/3^emax)) * (1 + 1/3 + ... + 1/3^emax)/(1 + 1/5 + ... + 1/5^emax)) * ... * (1 + 1/p + ... + 1/p^emax)/(1 + 1/q + ... + 1/q^emax))[telescoping product] = (1 + 1/2 + ... + 1/2^emax)/(1 + 1/qmax + ... + 1/qmax^emax) <= (1 + 1/2 + ... + 1/2^emax) < 2, where qmax = nextprime(pmax).
  So we have f(n) < 2 for all n.
  To prove that 2 is the supremum, we have lim_{e,k -> oo) f(prime(k)#^e) = 2.
(End)

Cf. A000203, A003961, A003973, A028982 (positions of odd terms), A072861, A151800, A286385, A341512, A341526, A341527, A341528, A341530, A342661, A342667, A342671, A342672.

Cf. also arrays A341605/A341606.

Array[DivisorSigma[1, #]*Times @@ Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[# == 1] &, 56] (* Michael De Vlieger, Feb 22 2021 *)

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341529(n) = (sigma(n)*A003961(n));

Multiplicative with a(p^e) = q^e * (p^(e+1)-1)/(p-1), where q = nextPrime(p).
a(n) = A000203(n) * A003961(n).
For all n > 1, a(n) > A341528(n).
For all n >= 1, A072861(n) <= a(n) <= A003961(n)^2. [See A286385].
a(n) = A341528(n) + A341512(n) = A342671(n) * A342672(n) = A342661(A003961(n)). - Antti Karttunen, Mar 22 2021
Sum_{k=1..n} a(k) ~ c * n^3, where c = (1/3) * Product_{p prime} p^4*(p-1)/((p^3-nextprime(p))*(p^2-nextprime(p))) = 3.0664809..., where nextprime is A151800. - Amiram Eldar, Dec 08 2022

A341528 a(n) = n * sigma(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of the divisors of n.

Original entry on oeis.org

1, 8, 18, 52, 40, 144, 84, 320, 279, 320, 154, 936, 234, 672, 720, 1936, 340, 2232, 456, 2080, 1512, 1232, 690, 5760, 1425, 1872, 4212, 4368, 928, 5760, 1178, 11648, 2772, 2720, 3360, 14508, 1554, 3648, 4212, 12800, 1804, 12096, 2064, 8008, 11160, 5520, 2538, 34848, 6517, 11400, 6120, 12168, 3180, 33696, 6160, 26880

Offset: 1

Antti Karttunen, Feb 16 2021

Cf. A000203, A003961, A003973, A016754 (positions of the odd terms), A151800, A341512, A341526, A341527, A341529, A341530, A342661, A342662, A342673.

Array[#1 DivisorSigma[1, #2] & @@ {#, Times @@ Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[# == 1]} &, 56] (* Michael De Vlieger, Feb 22 2021 *)

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A003973(n) = sigma(A003961(n));
A341528(n) = (n*A003973(n));

Multiplicative with a(p^e) = (p^e) * (q^(e+1)-1)/(q-1) where q = nextPrime(p).
a(n) = n * A003973(n) = n * A000203(A003961(n)).
From Antti Karttunen, Mar 29 2021: (Start)
a(n) <= A341529(n).
a(n) = A341529(n) - A341512(n).
a(n) = A342662(A003961(n)).
(End)
Sum_{k=1..n} a(k) ~ c * n^3, where c = (1/3) * Product_{p prime} p^3/((p+1)*(p^2-nextprime(p))) = 2.26342530..., where nextprime is A151800. - Amiram Eldar, Dec 08 2022

A341530 a(n) = gcd(nsigma(A003961(n)), sigma(n)A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

Original entry on oeis.org

1, 1, 2, 1, 2, 36, 4, 5, 1, 2, 2, 36, 2, 24, 120, 1, 2, 9, 4, 2, 8, 4, 6, 180, 1, 18, 4, 168, 2, 360, 2, 7, 12, 2, 336, 117, 2, 12, 4, 10, 2, 288, 4, 364, 30, 24, 6, 36, 19, 3, 360, 18, 6, 72, 56, 120, 16, 2, 2, 360, 2, 16, 4, 1, 12, 144, 4, 2, 60, 336, 2, 45, 2, 6, 10, 12, 264, 72, 4, 2, 11, 2, 6, 2016, 4, 12, 24

Offset: 1

Antti Karttunen, Feb 16 2021

nonn

Antti Karttunen, Table of n, a(n) for n = 1..8191
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Index entries for sequences computed from indices in prime factorization
Index entries for sequences related to sigma(n)

Cf. A000203, A003961, A003973, A028982 (positions of odd terms), A341512, A341526, A341527, A341528, A341529, A342670.

Cf. A342674 (same sequence applied onto prime shift array A246278).

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341530(n) = { my(t=A003961(n), s=sigma(t)); gcd((n*s), sigma(n)*t); };

a(n) = gcd(A341528(n), A341529(n)) = gcd(n*A003973(n), A000203(n)*A003961(n)).

a(n) = gcd(A341512(n), A341528(n)) = gcd(A341512(n), A341529(n)) = A342670(A003961(n)). - Antti Karttunen, Mar 24 2021

A341527 Denominator of ratio nsigma(A003961(n)) / sigma(n)A003961(n), where sigma is the sum of divisors of n, and A003961 shifts the prime factorization of n one step towards larger primes.

Original entry on oeis.org

1, 9, 10, 63, 21, 5, 22, 81, 325, 189, 78, 35, 119, 33, 7, 2511, 171, 325, 115, 1323, 220, 351, 116, 45, 1519, 119, 1250, 33, 465, 21, 592, 2187, 260, 1539, 11, 175, 779, 345, 1190, 1701, 903, 55, 517, 27, 455, 261, 424, 1395, 363, 4557, 19, 833, 531, 625, 117, 297, 575, 4185, 1830, 147, 2077, 666, 7150, 92583, 833, 195

Offset: 1

Antti Karttunen, Feb 16 2021

Denominator of ratio A341528(n)/A341529(n). A341526 gives the numerator, see comments there.

Cf. A000203, A003961, A003973, A017665, A017666, A336849, A341525, A341528, A341529, A341530.
Cf. A341526 (numerators).
Cf. A341627 (same sequence as applied onto prime shift array A246278).

f[p_, e_] := NextPrime[p]^e; g[1] = 1; g[n_] := Times @@ f @@@ FactorInteger[n]; a[n_] := Denominator[n*DivisorSigma[1, (gn = g[n])]/(DivisorSigma[1, n] * gn)]; Array[a, 100] (* Amiram Eldar, Feb 17 2021 *)

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341527(n) = { my(s=A003961(n)); denominator((sigma(s)*n)/(sigma(n)*s)); };

a(n) = A341529(n) / A341530(n) = A341529(n) / gcd(A341528(n), A341529(n)).

For all n > 1, a(n) > A341526(n).

A341525 Numerator of A003973(n) / A003961(n).

Original entry on oeis.org

1, 4, 6, 13, 8, 8, 12, 40, 31, 32, 14, 26, 18, 16, 48, 121, 20, 124, 24, 104, 72, 56, 30, 16, 57, 24, 156, 52, 32, 64, 38, 364, 84, 80, 96, 403, 42, 32, 108, 320, 44, 96, 48, 14, 248, 40, 54, 242, 133, 76, 24, 26, 60, 208, 16, 160, 144, 128, 62, 208, 68, 152, 372, 1093, 144, 112, 72, 260, 36, 128, 74, 248, 80, 56

Offset: 1

Antti Karttunen, Feb 16 2021

Also numerator of the ratio (A341528(n)/A341529(n)) / (n/sigma(n)).

Cf. A000203, A000290 (positions of odd terms), A003961, A003973, A017665, A151800, A336850, A341526, A341527, A341528, A341529, A341530.

Cf. A336849 (denominators).

f[p_, e_] := (p^(e + 1) - 1)/((p - 1)*p^e); g[p_, e_] := f[NextPrime[p], e]; a[1] = 1; a[n_] := Numerator[Times @@ g @@@ FactorInteger[n]]; Array[a, 100] (* Amiram Eldar, Feb 17 2021 *)

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341525(n) = { my(u=A003961(n), s=sigma(u)); (s/gcd(u, s)); };

a(n) = A017665(A003961(n)).
a(n) = A003973(n) / A336850(n) = A003973(n) / gcd(A003961(n), A003973(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} A341525(k)/A336849(k) = 1 / Product_{p prime} (1 - 1/(p*nextprime(p))) = 1.3766054560..., where nextprime(p) = A151800(p). - Amiram Eldar, Dec 28 2024

A342664 Denominator of ratio A342661(n)/A342662(n).

Original entry on oeis.org

1, 3, 8, 7, 9, 4, 20, 15, 52, 27, 21, 14, 77, 10, 4, 31, 117, 26, 170, 63, 160, 63, 114, 5, 279, 77, 64, 5, 115, 6, 464, 63, 28, 351, 6, 13, 589, 85, 308, 27, 777, 80, 902, 147, 26, 171, 516, 31, 1425, 837, 104, 539, 423, 32, 189, 25, 1360, 345, 530, 7, 1829, 232, 1040, 127, 231, 14, 2074, 117, 304, 9, 1206, 65, 2627

Offset: 1

Antti Karttunen, Mar 23 2021

Cf. A000203, A064989, A326041, A341526 [= a(A003961(n))], A341527, A342661, A342662, A342663 (numerators), A342667 [largest prime factor of a(A003961(n))], A342670.

A064989(n) = { my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f) };
A326041(n) = sigma(A064989(n));
A342661(n) = (n*A326041(n));
A342662(n) = (sigma(n)*A064989(n));
A342664(n) = { my(v=A342662(n)); (v/gcd(A342661(n),v)); };
\\ Alternatively as:
A342664(n) = denominator(A342661(n)/A342662(n));

a(n) = A342662(n) / A342670(n) = A342662(n) / gcd(A342661(n), A342662(n)).

A342663 Numerator of ratio A342661(n)/A342662(n): a(n) = A342661(n) / gcd(A342661(n), A342662(n)).

Original entry on oeis.org

1, 2, 9, 4, 10, 3, 21, 8, 63, 20, 22, 9, 78, 7, 5, 16, 119, 21, 171, 40, 189, 44, 115, 3, 325, 52, 81, 3, 116, 5, 465, 32, 33, 238, 7, 9, 592, 57, 351, 16, 779, 63, 903, 88, 35, 115, 517, 18, 1519, 650, 119, 312, 424, 27, 220, 14, 1539, 232, 531, 5, 1830, 155, 1323, 64, 260, 11, 2077, 68, 345, 7, 1207, 42, 2628, 1184

Offset: 1

Antti Karttunen, Mar 23 2021

Let r(row,col) = A341605(row,col)/A341606(row,col) and d(n) = A342661(n)/A342661(n) = A342663(n)/A342664(n). Then for row > 1, r(row-1,col) = d(A246278(row,col)) * r(row,col).

Cf. A000203, A064989, A246278, A326041, A341526, A341527 [= a(A003961(n))], A341605, A341606, A342661, A342662, A342664 (denominators), A342670.

A064989(n) = { my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f) };
A326041(n) = sigma(A064989(n));
A342661(n) = (n*A326041(n));
A342662(n) = (sigma(n)*A064989(n));
A342663(n) = { my(u=A342661(n)); (u/gcd(u, A342662(n))); };
\\ Alternatively as:
A342663(n) = numerator(A342661(n)/A342662(n));

a(n) = A342661(n) / A342670(n) = A342661(n) / gcd(A342661(n), A342662(n)).

A342667 Largest prime in the numerator of ratio A341528(n)/A341529(n) (when presented in its lowest terms).

Original entry on oeis.org

1, 2, 3, 13, 5, 2, 7, 2, 31, 5, 11, 13, 13, 7, 3, 11, 17, 31, 19, 13, 7, 11, 23, 2, 19, 13, 13, 13, 29, 2, 31, 13, 11, 17, 5, 31, 37, 19, 13, 5, 41, 7, 43, 11, 31, 23, 47, 11, 7, 19, 17, 13, 53, 13, 11, 7, 19, 29, 59, 13, 61, 31, 31, 1093, 13, 11, 67, 17, 23, 5, 71, 31, 73, 37, 19, 19, 7, 13, 79, 11, 71, 41, 83, 13

Offset: 1

Antti Karttunen, Mar 23 2021

nonn

Equally, largest prime in the denominator of ratio A342661(A003961(n)) / A342662(A003961(n)).

Cf. A000203, A003961, A006530, A064989, A341526, A341528, A341529, A326041, A342661, A342662, A342664, A342668.

Cf. also A341607.

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A006530(n) = if(n>1, vecmax(factor(n)[, 1]), 1);
A341526(n) = { my(s=A003961(n)); numerator((sigma(s)*n)/(sigma(n)*s)); };
A342667(n) = A006530(A341526(n));

a(n) = A006530(A341526(n)).

a(n) = A006530(A342664(A003961(n))).

cp's OEIS Frontend

A341626 Square array A(n,k) = A341526(A246278(n,k)), read by falling antidiagonals; Numerators of the columnwise first quotients of A341605/A341606.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A246278 Prime shift array: Square array read by antidiagonals: A(1,col) = 2*col, and for row > 1, A(row,col) = A003961(A(row-1,col)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

Extensions

A341529 a(n) = sigma(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of the divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A341528 a(n) = n * sigma(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of the divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A341530 a(n) = gcd(n*sigma(A003961(n)), sigma(n)*A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A341527 Denominator of ratio n*sigma(A003961(n)) / sigma(n)*A003961(n), where sigma is the sum of divisors of n, and A003961 shifts the prime factorization of n one step towards larger primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A341525 Numerator of A003973(n) / A003961(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A342664 Denominator of ratio A342661(n)/A342662(n).

Views

Author

A341530 a(n) = gcd(nsigma(A003961(n)), sigma(n)A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

A341527 Denominator of ratio nsigma(A003961(n)) / sigma(n)A003961(n), where sigma is the sum of divisors of n, and A003961 shifts the prime factorization of n one step towards larger primes.