cp's OEIS Frontend

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.

Showing 1-3 of 3 results.

A301414 Distinct terms of A301413 in ascending order: terms k in A301413 that have at least one number m such that k * A002110(m) is a highly composite number (A002182) with m distinct prime factors.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 24, 36, 48, 72, 96, 120, 144, 216, 240, 288, 360, 480, 576, 720, 1080, 1440, 2160, 2880, 4320, 5040, 7200, 7560, 8640, 10080, 14400, 15120, 20160, 30240, 40320, 50400, 60480, 90720, 100800, 120960, 151200, 181440, 241920, 302400, 362880
Offset: 1

Views

Author

Michael De Vlieger, Apr 09 2018

Keywords

Comments

Given that highly composite numbers (HCNs) are products of primorials, we note the following:
1. The only odd term is 1.
2. The only primorials, i.e., terms in A002110, are {1, 2, 6}, consequently the only squares in A002182 are {1, 4, 36}.
3. The only terms in A000079 are {1, 2, 4, 8}. These produce {1, 2, 6}, {4, 12, 30}, {24, 120, 840}, and {48, 240, 1680}, in A002182 respectively.
4. This sequence is a subset of A025487, which is a subset of A055932.
Also given that A002182 strictly increases, we note that i <= m <= j, integers, for which P = k * A002110(m) produces HCNs. As we increment m we increase the rank of the tensor of prime divisor power ranges and double the number of divisors. However, we may have another term P' = a * A002110(b) for a > k and b < (j + 1) such that P' < P yet tau(P') >= tau(P). This P' is in A002182 and has increased tau by the lengthening of the power ranges for relatively small primes via some composite b instead of increasing the rank of the tensor. Since A002182 strictly increases, we have a limited range for m.
There are 19 terms also in A002182: 1, 2, 4, 6, 12, 24, 36, 48, 120, 240, 360, 720, 5040, 7560, 10080, 15120, 20160, 50400, 17297280.
Let n = A002110(m), and consider the ordered pair (n, k). In a plot of ordered pairs that produce m in A002182, we have the first terms of A002182 thus: (0,1), (1,1), (1,2), (2,1), (2,2), (2,4), (2,6), (2,8), (3,2), (3,4), (3,6), (3,8), (3,12), etc.

Examples

			Plot of (n,k) with n in A002110 and k a term in this sequence such that A002110(n) * k is in A002182. Asterisks denote products that are in A002201.
   {0,1} {1,1} {2,1}
     1     2*    6*
         {1,2} {2,2} {3,2}
           4     12*   60*
               {2,4} {3,4}  {4,4}
                 24   120*   840
               {2,6} {3,6}  {4,6}
                 36   180    1260
               {2,8} {3,8}  {4,8}
                 48   240    1680
                    {3,12} {4,12}   {5,12}
                      360*   2520*   27720
                    {3,24} {4,24}   {5,24}    {6,24}
                      720    5040*   55440*   720720*
                           {4,36}   {5,36}    {6,36}
                             7560    83160   1081080
                           {4,48}   {5,48}    {6,48}
                            10080   110880   1441440*
                            ...     ...      ...       ...
		

Crossrefs

Programs

  • Mathematica
    (* First load b-file from A002182 minus any comments therein *)
    s = Import["b002182.txt","Data"][[All,-1]];
    (* Alternatively, download Flammenkamp dataset, decompress and rename to "HCN.txt", then decode using the following in place of s above *)
    s = Times @@ {Times @@ Prime@ Range@ ToExpression@ First@ #1, If[# == {}, 1, Times @@ MapIndexed[Prime[First@ #2]^#1 &, #]] &@ DeleteCases[-1 + Flatten@ Map[If[StringFreeQ[#, "^"], ToExpression@ #, ConstantArray[#1, #2] & @@ ToExpression@ StringSplit[#, "^"]] &, #2], 0]} & @@ TakeDrop[Drop[StringSplit@ #, 2], 1] & /@ Import["HCN.txt", "Data"];
    Union@ Array[#1/Product[Prime@ i, {i, #2}] & @@ {#, PrimeNu@ #} &@ s[[#]] &, Length@ s]

A281959 a(n) = sigma_25(n), the sum of the 25th powers of the divisors of n.

Original entry on oeis.org

1, 33554433, 847288609444, 1125899940397057, 298023223876953126, 28430288877251865252, 1341068619663964900808, 37778932988857102106625, 717897987692699877379693, 10000000298023223910507558, 108347059433883722041830252, 953962194872104906760006308
Offset: 1

Views

Author

Seiichi Manyama, Feb 03 2017

Keywords

Comments

For k > 0, Sum_{n>=1} sigma_(4*k+1)(n) / exp(2*Pi*n) = Bernoulli(4*k+2)/(8*k+4). For k = 0, Sum_{n>=1} sigma(n)/exp(2*Pi*n) = 1/24 - 1/(8*Pi) = Bernoulli(2)/4 - 1/(8*Pi). - Vaclav Kotesovec, May 07 2023
Since n^25 == n^5 (mod 25), it follows that sigma_25(n) == sigma_5(n) (mod 25). In fact, sigma_25(n) == sigma_(5) (mod 13200), where 13200 = (2^4)*3*(5^2)*11 = A006863(10). - Peter Bala, Jan 12 2025

Examples

			For n = 6: The divisors of 6 are 1, 2, 3, 6, so a(6) = sigma_25(6) = 1^25 + 2^25 + 3^25 + 6^25 = 28430288877251865252. - _Felix Fröhlich_, Feb 03 2017
		

Crossrefs

Programs

  • Mathematica
    DivisorSigma[25,Range[20]] (* Harvey P. Dale, Jul 08 2024 *)
  • PARI
    a(n) = sigma(n, 25) \\ Felix Fröhlich, Feb 03 2017
    
  • Python
    from sympy import divisor_sigma
    def A281959(n): return divisor_sigma(n,25) # Chai Wah Wu, May 07 2023

Formula

G.f.: Sum_{k>=1} k^25*x^k/(1-x^k).
a(n) == A037947(n) mod 657931.
a(n) = Sum_{k=1..A000005(n)} A275055(k)^25. - Felix Fröhlich, Feb 03 2017
Sum_{n>=1} a(n)/exp(2*Pi*n) = 657931/24 = Bernoulli(26)/52. - Vaclav Kotesovec, May 07 2023
From Amiram Eldar, Oct 29 2023: (Start)
Multiplicative with a(p^e) = (p^(25*e+25)-1)/(p^25-1).
Dirichlet g.f.: zeta(s)*zeta(s-25).
Sum_{k=1..n} a(k) = zeta(26) * n^26 / 26 + O(n^27). (End)

A275280 Irregular triangle listing numbers m of n that have prime divisors p that also divide n, in order of appearance in a matrix of products that arranges the powers of prime divisors p of n along independent axes.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 4, 1, 5, 1, 2, 4, 3, 6, 1, 7, 1, 2, 4, 8, 1, 3, 9, 1, 2, 4, 8, 5, 10, 1, 11, 1, 2, 4, 8, 3, 6, 12, 9, 1, 13, 1, 2, 4, 8, 7, 14, 1, 3, 9, 5, 15, 1, 2, 4, 8, 16, 1, 17, 1, 2, 4, 8, 16, 3, 6, 12, 9, 18, 1, 19, 1, 2, 4, 8, 16, 5, 10, 20, 1, 3, 9, 7, 21, 1, 2, 4, 8, 16, 11, 22, 1, 23
Offset: 1

Views

Author

Michael De Vlieger, Jul 28 2016

Keywords

Comments

Product matrix of tensors T = 1,p,p^2,...,p^e that include the powers 1 <= e of prime divisors p such that p^e <= n.
This sequence is analogous to A275055 but differs from it in that the tensors T include not only powers p^e that divide n but all powers p^e <= n.
The matrix a(n) is bounded by n, thus all products m <= n.
Let omega(n) = A001221(n). The matrix a(n) has omega(n) dimensions and is an omega(n)-dimensional simplex with (omega(n)-1) "right-angle: sides and 1 irregular surface that is bounded by n.
A027750(n) is a subset of A162306(n) and in a(n), the terms of A275055(n) appear in an contiguous omega(n)-dimensional parallelepiped (parallelotope) with 1 at the origin and n at the opposite corner. Thus the omega(n)-dimensional array described by A275055(n) is fully contained in the simplex-like matrix described by a(n). Divisors appear within the parallelepiped while nondivisors appear in the field outside the parallelepiped (see examples). Terms within the parallelepiped appear in A027750(n) while those outside appear in A272618(n).
For a(2^x + 2) there is a term m = (n-2); m != (n-1) except for n=2, since GCD(n, n-1)=1.
a(p^e) = A027750(p^e) = A162306(p^e) = A275055(p^e) for e >= 1.

Examples

			Triangle begins:
1;
1, 2;
1, 3;
1, 2, 4;
1, 5;
1, 2, 4, 3, 6;
1, 7;
1, 2, 4, 8;
1, 3, 9;
1, 2, 4, 8, 5, 10;
1, 11;
1, 2, 4, 8, 3, 6, 12, 9;
1, 13;
1, 2, 4, 8, 7, 14;
1, 3, 9, 5, 15;
1  2, 4, 8, 16;
1, 17;
1, 2, 4, 8, 16, 3, 6, 12, 9, 18;
...
2 prime divisors: n = 96
   1  2  4  8 16 32 64
   3  6 12 24 48 96
   9 18 36 72
  27 54
  81
thus a(96) = {1,2,4,8,16,32,64,3,6,12,24,48,96,9,18,36,72,27,54,81}.
The divisors of 72 (thus the terms of A275055(72)) appear in a rectangle delimited by 1 at top left and 72 at bottom right.
3 prime divisors: n = 60
(the 3 dimensional levels correspond with powers of 5)
   level 5^0:            level 5^1:         level 5^2:
   1  2  4  8 16 32  |    5 10 20 40    |   25 50
   3  6 12 24 48     |   15 30 60       |
   9 18 36           |   45             |
  27 54              |                  |
thus a(60) = {1,2,4,8,16,32,3,6,12,24,48,9,18,36,27,54,5,10,20,40,15,30,60,45,25,50}.
The divisors of 60 (thus the terms of A275055(60)) appear in a parallelepiped delimited by 1 at top left of level 5^0 and 60 at bottom right of level 5^1.
		

Crossrefs

Cf. A162306, A010846 (row length), A243103 (row product), A027750 (divisors of n), A000005 (number of divisors of n), A272618 (nondivisors m <= n that have prime divisors p that also divide n), A243822 (number of such nondivisors of n), A275055 (Product of tensor of prime divisor powers that are also divisors).

Programs

  • Mathematica
    f[n_] := If[n == 1, 1, Function[w, ToExpression@ StringJoin["With[{n=", ToString@ n, "}, Table[", ToString@ InputForm[Times @@ Map[Power @@ # &, w]], ", ", Most@ Flatten@ Map[{#, ", "} &, #], "]]"] &@ MapIndexed[Function[p, StringJoin["{", ToString@ Last@ p, ", 0, Log[", ToString@ First@ p, ", n/(", ToString@ InputForm[Times @@ Map[Power @@ # &, Take[w, First@ #2 - 1]]], ")]}"]]@ w[[First@ #2]] &, w]]@ Map[{#, ToExpression["p" <> ToString@ PrimePi@ #]} &, Reverse[FactorInteger[n][[All, 1]]]] ]; Array[f, 24] // Flatten (* Michael De Vlieger, Mar 08 2017 *)
Showing 1-3 of 3 results.