A068507 -id:A068507 - cp's OEIS frontend

A002182 Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.

1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680, 2520, 5040, 7560, 10080, 15120, 20160, 25200, 27720, 45360, 50400, 55440, 83160, 110880, 166320, 221760, 277200, 332640, 498960, 554400, 665280, 720720, 1081080, 1441440, 2162160

Offset: 1

N. J. A. Sloane

Where record values of d(n) occur: d(n) > d(k) for all k < n.
A002183 is the RECORDS transform of A000005, i.e., lists the corresponding values d(n) for n in A002182.
Flammenkamp's page also has a copy of the missing Siano paper.
Highly composite numbers are the product of primorials, A002110. See A112779 for the number of primorial terms in the product of a highly composite number. - Jud McCranie, Jun 12 2005
Sigma and tau for highly composite numbers through the 146th entry conform to a power fit as follows: log(sigma)=A*log(tau)^B where (A,B) =~ (1.45,1.38). - Bill McEachen, May 24 2006
a(n) often corresponds to P(n,m) = number of permutations of n things taken m at a time. Specifically, if start=1, pointers 1-6, 9, 10, 13-15, 17-19, 22, 23, 28, 34, 37, 43, 52, ... An example is a(37)=665280, which is P(12,6)=12!/(12-6)!. - Bill McEachen, Feb 09 2009
Concerning the previous comment, if m=1, then P(n,m) can represent any number. So let's assume m > 1. Searching the first 1000 terms, the only indices of terms of the form P(n,m) are 4, 5, 6, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 27, 28, 31, 34, 37, 41, 43, 44, 47, 50, 52, and 54. Note that a(44) = 4324320 = P(2079,2). See A163264. - T. D. Noe, Jun 10 2009
A large number of highly composite numbers have 9 as their digit root. - Parthasarathy Nambi, Jun 07 2009
Because 9 divides all highly composite numbers greater than 1680, those numbers have digital root 9. - T. D. Noe, Jul 24 2009
See A181309 for highly composite numbers that are not highly abundant.
a(n) is also defined by the recurrence: a(1) = 1, a(n+1)/sigma(a(n+1)) < a(n) / sigma(a(n)). - Michel Lagneau, Jan 02 2012 [NOTE: This "definition" is wrong (a(20)=7560 does not satisfy this inequality) and incomplete: It does not determine a sequence uniquely, e.g., any subsequence would satisfy the same relation. The intended meaning is probably the definition of the (different) sequence A004394. - M. F. Hasler, Sep 13 2012]
Up to a(1000), the terms beyond a(5) = 12 resp. beyond a(9) = 60 are a multiples of these. Is this true for all subsequent terms? - M. F. Hasler, Sep 13 2012 [Yes: see EXAMPLE in A199337! - M. F. Hasler, Jan 03 2020]
Differs from the superabundant numbers from a(20)=7560 on, which is not in A004394. The latter is not a subsequence of A002182, as might appear from considering the displayed terms: The two sequences have only 449 terms in common, the largest of which is A002182(2567) = A004394(1023). See A166735 for superabundant numbers that are not highly composite, and A004394 for further information. - M. F. Hasler, Sep 13 2012
Subset of A067128 and of A025487. - David A. Corneth, May 16 2016, Jan 03 2020
It seems that a(n) +- 1 is often prime. For n <= 1000 there are 210 individual primes and 17 pairs of twin primes. See link to Lim's paper below. - Dmitry Kamenetsky, Mar 02 2019
There are infinitely many numbers in this sequence and a(n+1) <= 2*a(n), because it is sufficient to multiply a(n) by 2 to get a number having more divisors. (This proves Guess 0 in the Lim paper.) For n = (1, 2, 4, 5, 9, 13, 18, ...) one has equality in this bound, but asymptotically a(n+1)/a(n) goes to 1, cf. formula due to Erdős. See A068507 for the terms such that a(n)+-1 are twin primes. - M. F. Hasler, Jun 23 2019
Conjecture: For n > 7, a(n) is a Zumkeller number (A083207). Verified for n up to and including 48. If this conjecture is true, one may base on it an alternative proof of the fact that for n>7 a(n) is not a perfect square (see Fact 5, Rao/Peng arXiv link at A083207). - Ivan N. Ianakiev, Jun 29 2019
The conjecture above is true (see the proof in the "Links" section). - Ivan N. Ianakiev, Jan 31 2020
The first instance of omega(a(n)) < omega(a(n-1)) (omega = A001221: number of prime divisors) is at a(26) = 45360. Up to n = 10^4, 1759 terms have this property, but omega decreases by 2 only at indices n = 5857, 5914 and 5971. - M. F. Hasler, Jan 02 2020
Inequality (54) in Ramanujan (1915) implies that for any m there is n* such that m | a(n) for all n > n*: see A199337 for the proof. - M. F. Hasler, Jan 03 2020

			a(5) = 12 is in the sequence because A000005(12) is larger than any earlier value in A000005. - _M. F. Hasler_, Jan 03 2020

CRC Press Standard Mathematical Tables, 28th Ed, p. 61.
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 180, p. 56, Ellipses, Paris 2008.
L. E. Dickson, History of Theory of Numbers, I, p. 323.
Ross Honsberger, An introduction to Ramanujan's Highly Composite Numbers, Chap. 14 pp. 193-200 Mathematical Gems III, DME no. 9 MAA 1985
Jean-Louis Nicolas, On highly composite numbers, pp. 215-244 in Ramanujan Revisited, Editors G. E. Andrews et al., Academic Press 1988
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 88.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 128.

Michael De Vlieger, Table of n, a(n) for n = 1..10000 (obtained from A. Flammenkamp's data; first 1000 terms from T. D. Noe)
Yu. Bilu, P. Habegger, and L. Kühne, Effective bounds for singular units, arXiv:1805.07167 [math.NT], 2018.
Benjamin Braun and Brian Davis, Antichain Simplices, arXiv:1901.01417 [math.CO], 2019.
Harold W. Ellingsen, Jr., A Fresh Look at Highly Composite Numbers, The American Mathematical Monthly, Vol. 126, No. 8 (2019), pp. 740-741.
Paul Erdős, On Highly composite numbers, J. London Math. Soc., Vol. 19 (1944), pp. 130-133, MR7,145d; Zentralblatt 61,79.
Achim Flammenkamp, Highly composite numbers.
Achim Flammenkamp, List of the first 1200 highly composite numbers.
Achim Flammenkamp, List of the first 779,674 highly composite numbers.
James Grime and Brady Haran, 5040 and other Anti-Prime Numbers, Numberphile video (2016).
Bob Hinman, Letter to N. J. A. Sloane, Aug. 1980.
Ivan N. Ianakiev, On the question "Which Highly composite numbers (A002182) are Zumkeller numbers (A083207)?".
Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, and Alexey Belyshev, Enumerating Diagonal Latin Squares of Order Up to 9, J. Int. Seq., Vol. 23 (2020), Article 20.1.2.
Aneesh M. Koya and P. P. Deepthi, Plug and play self-configurable IoT gateway node for telemonitoring of ECG, Computers in Biology and Medicine, Vol. 112 (2019), 103359.
Jeffrey C. Lagarias, An elementary problem equivalent to the Riemann hypothesis, Am. Math. Monthly 109 (#6, 2002), 534-543; arXiv:math/0008177 [math.NT], 2000-2001.
Bill Lauritzen, Versatile Numbers -Versatile Economics.
Benny Lim, Prime Numbers Generated From Highly Composite Numbers, Parabola Magazine, Volume 54, Issue 3, (2018).
R. J. Mathar, Maple program to convert the Flammenkamp file to an OEIS b-file.
R. J. Mathar, Output of above Maple program. [Uncompresses to 9.1 MB]
Graeme McRae, Highly Composite Numbers.
Jean-Louis Nicolas, Ordre maximal d'un élément du groupe S_n de permutations et 'highly composite numbers' (Text in French).
Jean-Louis Nicolas and Guy Robin, Highly Composite Numbers by Srinivasa Ramanujan, The Ramanujan Journal, Vol. 1(2), pp. 119-153, Kluwer Academics Pub.
Kevin O'Bryant, PlanetMath.org, Highly composite number.
S. Ramanujan, Highly composite numbers, Proceedings of the London Mathematical Society, Ser. 2, Vol. XIV, No. 1 (1915), pp. 347-409. (DOI: 10.1112/plms/s2_14.1.347, also available with an additional footnote in the PDF at http://ramanujan.sirinudi.org/Volumes/published/ram15.html)
Steven Ratering, An interesting subset of the highly composite numbers, Math. Mag., Vol. 64, No. 5 (1991), pp. 343-346.
Guy Robin, Méthodes d'optimisation pour un problème de théorie des nombres, RAIRO Informatique Théorique, Vol. 17, No. 3 (1983), pp. 239-247.
Vladimir Shevelev, On Erdős constant, arXiv:1605.08884 [math.NT], 2016.
D. B. Siano and J. D. Siano, An Algorithm for Generating Highly Composite Numbers, 1994.
N. J. A. Sloane, Transforms.
Michel Waldschmidt, From highly composite numbers to transcendental number theory, 2013.
Eric Weisstein's World of Mathematics, Highly Composite Number.
Wikipedia, Highly composite number.

Cf. A000005 (number of divisors), A002110, A002183, A002473, A004394, A025487, A106037, A108602, A112778, A112779, A112780, A112781, A006218, A126098, A002201, A072938, A094348, A003418, A161184, A037992 (infinitary analog), A108951, A329902, A352418.
Cf. A261100 (a left inverse).
Cf. A002808. - Peter J. Marko, Aug 16 2018
Cf. A279930 (highly composite and highly Brazilian).
Cf. A068507 (terms such that a(n)+-1 are twin primes).
Cf. A199337 (number of terms not divisible by n).

a = 0; Do[b = DivisorSigma[0, n]; If[b > a, a = b; Print[n]], {n, 1, 10^7}]
(* Convert A. Flammenkamp's 779674-term dataset; first, decompress, rename "HCN.txt": *)
a = 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[StringSplit@ #, 1] & /@ Import["HCN.txt", "Data"] (* Michael De Vlieger, May 08 2018 *)
DeleteDuplicates[Table[{n,DivisorSigma[0,n]},{n,2163000}],GreaterEqual[ #1[[2]],#2[[2]]]&] [[All,1]] (* Harvey P. Dale, May 13 2022 *)
NestList[Function[last,
  Module[{d = DivisorSigma[0, last]},
   NestWhile[# + 1 &, last, DivisorSigma[0, #] <= d &]]], 1, 40] (* Steven Lu, Mar 30 2023 *)

print1(r=1); forstep(n=2,1e5,2, if(numdiv(n)>r, r=numdiv(n); print1(", "n))) \\ Charles R Greathouse IV, Jun 10 2011

v002182 = [1]/*vector for memoization*/; A002182(n, i = #v002182) ={ if(n > i, v002182 = Vec(v002182, n); my(k = v002182[i], d, s=1); until(i == n, d = numdiv(k); s<60 && k>=60 && s=60; until(numdiv(k += s) > d,); v002182[i++] = k); k, v002182[n])} \\ Antti Karttunen, Jun 06 2017; edited by M. F. Hasler, Jan 03 2020 and Jun 20 2022

is_A002182(n, a=1, b=1)={while(n>A002182(b*=2), a*=2); until(a>b, my(m=(a+b)\2, t=A002182(m)); if(tn, b=m-1, return(m)))} \\ Also used in other sequences. - M. F. Hasler, Jun 20 2022

from sympy import divisor_count
A002182_list, r = [], 0
for i in range(1,10**4):
    d = divisor_count(i)
    if d > r:
        r = d
        A002182_list.append(i) # Chai Wah Wu, Mar 23 2015

Also, for n >= 2, smallest values of p for which A006218(p)-A006318(p-1) = A002183(n). - Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Jun 23 2007
a(n+1) < a(n) * (1+log(a(n))^-c) for some positive c (see Erdős). - David A. Corneth, May 16 2016
a(n) = A108951(A329902(n)). - Antti Karttunen, Jan 08 2020
a(n+1) <= 2*a(n). For cases where the equal sign holds, see A072938. - A.H.M. Smeets, Jul 10 2021
Sum_{n>=1} 1/a(n) = A352418. - Amiram Eldar, Mar 24 2022

Jun 19 1996: Changed beginning to start at 1.
Jul 10 1996: Matthew Conroy points out that these are different from the super-abundant numbers - see A004394. Last 8 terms sent by J. Lowell; checked by Jud McCranie.
Description corrected by Gerard Schildberger and N. J. A. Sloane, Apr 04 2001
Additional references from Lekraj Beedassy, Jul 24 2001

A014574 Average of twin prime pairs.

Original entry on oeis.org

4, 6, 12, 18, 30, 42, 60, 72, 102, 108, 138, 150, 180, 192, 198, 228, 240, 270, 282, 312, 348, 420, 432, 462, 522, 570, 600, 618, 642, 660, 810, 822, 828, 858, 882, 1020, 1032, 1050, 1062, 1092, 1152, 1230, 1278, 1290, 1302, 1320, 1428, 1452, 1482, 1488, 1608

Offset: 1

R. K. Guy, N. J. A. Sloane, Eric W. Weisstein

With an initial 1 added, this is the complement of the closure of {2} under a*b+1 and a*b-1. - Franklin T. Adams-Watters, Jan 11 2006
Also the square root of the product of twin prime pairs + 1. Two consecutive odd numbers can be written as 2k+1,2k+3. Then (2k+1)(2k+3)+1 = 4(k^2+2k+1) = 4(k+1)^2, a perfect square. Since twin prime pairs are two consecutive odd numbers, the statement is true for all twin prime pairs. - Cino Hilliard, May 03 2006
Or, single (or isolated) composites. Nonprimes k such that neither k-1 nor k+1 is nonprime. - Juri-Stepan Gerasimov, Aug 11 2009
Numbers n such that sigma(n-1) = phi(n+1). - Farideh Firoozbakht, Jul 04 2010
Aside from the first term in the sequence, all remaining terms have digital root 3, 6, or 9. - J. W. Helkenberg, Jul 24 2013
Numbers n such that n^2-1 is a semiprime. - Thomas Ordowski, Sep 24 2015
Every term but the first is a multiple of 6. - Harvey P. Dale, Mar 31 2023

Archimedeans Problems Drive, Eureka, 30 (1967).

T. D. Noe, Table of n, a(n) for n = 1..10000
C. K. Caldwell, The Prime Glossary: Twin primes
C. K. Caldwell, The Top Twenty: Twin Primes
Y. Fujiwara, Parsing a Sequence of Qubits, IEEE Trans. Information Theory, 59 (2013), 6796-6806.
Y. Fujiwara, Parsing a Sequence of Qubits, arXiv:1207.1138 [quant-ph], 2012-2013.
L. J. Gerstein, A reformulation of the Goldbach conjecture, Math. Mag., 66 (1993), 44-45.
Brian Hayes, Does having prime neighbors make you more composite?, Bit-Player Article, Nov 04 2021
Eric Weisstein's World of Mathematics, Twin Primes

Cf. A000010, A000203, A001359, A002822, A006512, A037074, A040040, A054735, A077800, A111046.

A068507 is the intersection of A002182 and this sequence.

a:=1+Filtered([1..2000],p->IsPrime(p) and IsPrime(p+2)); # Muniru A Asiru, May 20 2018

a014574 n = a014574_list !! (n-1)
a014574_list = [x | x <- [2,4..], a010051 (x-1) == 1, a010051 (x+1) == 1]
-- Reinhard Zumkeller, Apr 11 2012

P := select(isprime,[$1..1609]): map(p->p+1,select(p->member(p+2,P),P)); # Peter Luschny, Mar 03 2011
A014574 := proc(n) option remember; local p ; if n = 1 then 4 ; else p := nextprime( procname(n-1) ) ; while not isprime(p+2) do p := nextprime(p) ; od ; return p+1 ; end if ; end proc: # R. J. Mathar, Jun 11 2011

Select[Table[Prime[n] + 1, {n, 260}], PrimeQ[ # + 1] &] (* Ray Chandler, Oct 12 2005 *)
Mean/@Select[Partition[Prime[Range[300]],2,1],Last[#]-First[#]==2&] (* Harvey P. Dale, Jan 16 2014 *)

A014574(n) := block(
    if n = 1 then
        return(4),
    p : A014574(n-1) ,
    for k : 2 step 2 do (
        if primep(p+k-1) and primep(p+k+1) then
            return(p+k)
    )
)$ /* R. J. Mathar, Mar 15 2012 */

p=2;forprime(q=3,1e4,if(q-p==2,print1(p+1", "));p=q) \\ Charles R Greathouse IV, Jun 10 2011

a(n) = (A001359(n) + A006512(n))/2 = 2*A040040(n) = A054735(n)/2 = A111046(n)/4.
a(n) = A129297(n+4). - Reinhard Zumkeller, Apr 09 2007
A010051(a(n) - 1) * A010051(a(n) + 1) = 1. Reinhard Zumkeller, Apr 11 2012
a(n) = 6*A002822(n-1), n>=2. - Ivan N. Ianakiev, Aug 19 2013
a(n)^4 - 4*a(n)^2 = A062354(a(n)^2 - 1). - Raphie Frank, Oct 17 2013

Offset changed to 1 by R. J. Mathar, Jun 11 2011

A072828 Primes p such that p+1 is a highly composite number.

Original entry on oeis.org

3, 5, 11, 23, 47, 59, 179, 239, 359, 719, 839, 1259, 5039, 7559, 10079, 55439, 110879, 166319, 665279, 1081079, 1441439, 6486479, 32432399, 61261199, 698377679, 735134399, 1102701599, 1396755359, 2205403199, 20951330399, 41902660799

Offset: 1

Shyam Sunder Gupta, Jul 21 2002

nonn

			47 is a term because it is prime and also 47+1=48 is a highly composite number.

Amiram Eldar, Table of n, a(n) for n = 1..441 (terms below 10^1000; terms 1..300 from T. D. Noe)
Benny Lim, Prime Numbers Generated From Highly Composite Numbers, Parabola Magazine, volume 54, issue 3, 2018.

Cf. A002182, A068507, A072826, A214873, A306588.

a(n) == 2 (mod 3) for n > 1 (because highly composite numbers > 4 are == 0 (mod 3); see A002182). - Jonathan Sondow, Nov 05 2015

a(n) = A002182(A306588(n)) - 1. - Amiram Eldar, Dec 03 2020

A321995 Indices of highly composite numbers A002182 which are between a twin prime pair.

Original entry on oeis.org

3, 4, 5, 9, 11, 12, 20, 28, 30, 84, 108, 118, 143, 149, 208, 330, 362, 1002, 2395, 3160, 10535

Offset: 1

M. F. Hasler, Jun 23 2019

The highly composite numbers are listed in A068507, but their growth is such that one cannot list the terms beyond A002182(362), corresponding to a(17), in the DATA section.
The term a(21) corresponds to A002182(10535) = A108951(52900585920). - Daniel Suteu, Jun 27 2019
a(22) > 779674, if it exists. - Amiram Eldar, Dec 03 2020

Cf. A068507, A002182, A002822.

select( x->ispseudoprime(x-1)&&ispseudoprime(x+1), A2182, 1) \\ assuming A2182 holds enough terms of A002182. - M. F. Hasler, Jun 23 2019

Intersection of A306587 and A306588. - Daniel Suteu, Jun 27 2019

a(21) from Daniel Suteu, Jun 27 2019 (obtained from A. Flammenkamp's data)

A353302 Numbers k such that A004394(k)-1 and A004394(k)+1 are twin primes.

Original entry on oeis.org

3, 4, 5, 9, 11, 12, 24, 25, 76, 82, 105, 139, 217, 1370

Offset: 1

Amiram Eldar, Apr 10 2022

a(15) > 10^5, if it exists.

			3 is a term since the third superabundant number is A004394(3) = 4 and {4-1, 4+1} = {3, 5} is a twin primes pair.

Intersection of A353300 and A353301.

Cf. A001097, A004394, A068507, A321995.

s = {}; abm = 0; k = 0; Do[ab = DivisorSigma[-1, n]; If[ab > abm, abm = ab; k++; If[PrimeQ[n - 1] && PrimeQ[n + 1], AppendTo[s, k]]], {n, 1, 10^6}]; s

A375197 Terms k in A025487 such that k-1 and k+1 are twin primes.

Original entry on oeis.org

4, 6, 12, 30, 60, 72, 180, 192, 240, 420, 432, 1152, 2310, 2592, 3360, 6300, 7560, 9240, 15360, 21600, 23040, 26880, 55440, 100800, 110880, 138240, 180180, 241920, 264600, 345600, 415800, 453600, 737280, 786432, 995328, 1088640, 1921920, 1940400, 2116800, 3456000

Offset: 1

Amiram Eldar, Aug 04 2024

nonn

Amiram Eldar, Table of n, a(n) for n = 1..10000

Intersection of A014574 and A025487.
Subsequence of A344385.
A068507 is a subsequence.
Cf. A001097, A001359, A006512, A344384, A375198.

Select[Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]], And @@ PrimeQ[# + {-1, 1}] &]

a(n) = A025487(A375198(n)).

A340580 Ramanujan's highly composite numbers A002182 sandwiched between nonprimes.

Original entry on oeis.org

120, 1680, 25200, 27720, 50400, 83160, 221760, 277200, 554400, 720720, 2162160, 2882880, 3603600, 7207200, 8648640, 10810800, 17297280, 21621600, 36756720, 73513440, 122522400, 147026880, 245044800, 294053760, 551350800, 2095133040, 2327925600, 2793510720, 3491888400

Offset: 1

Omar E. Pol, Aug 17 2021

nonn

			120 is in the sequence because it is an highly composite numbers A002182 and its nearest neighbors 119 and 121 both are nonprimes.

Cf. A002182, A018252, A068507, A346529.

s = {}; dm = 0; Do[d = DivisorSigma[0, n]; If[d > dm, dm = d; If[! PrimeQ[n - 1] && ! PrimeQ[n + 1], AppendTo[s, n]]], {n, 1, 10^6}]; s (* Amiram Eldar, Aug 17 2021 *)

More terms from Amiram Eldar, Aug 17 2021

A346529 a(n) is the number of primes that are nearest neighbors of the n-th Ramanujan's highly composite number A002182.

Original entry on oeis.org

1, 1, 2, 2, 2, 1, 1, 1, 2, 0, 2, 2, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 0, 0, 1, 0, 2, 0, 2, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 2, 0, 0, 0

Offset: 1

Omar E. Pol, Aug 17 2021

nonn

Terms are only 0, 1 or 2.

			For n = 8 the 8th highly composite numbers is 48, thus its nearest neighbors are 47 and 49, only 47 is prime so a(8) = 1.
For n = 9 the 9th highly composite numbers is 60, thus its nearest neighbors are 59 and 61, both are twin primes so a(9) = 2.
For n = 10 the 10th highly composite numbers is 120, thus its nearest neighbors are 119 and 121, both are nonprimes so a(10) = 0.

Cf. A001097, A002182, A010051, A018252, A068507, A340580.

f[n_] := Count[n + {-1, 1}, ?PrimeQ]; s = {}; dm = 0; Do[d = DivisorSigma[0, n]; If[d > dm, dm = d; AppendTo[s, f[n]]], {n, 1, 10^6}]; s (* _Amiram Eldar, Aug 17 2021 *)

a(n) = A010051(A002182(n)-1) + A010051(A002182(n)+1). - Michel Marcus, Aug 17 2021

More terms from Amiram Eldar, Aug 17 2021

A328329 Lesser of twin primes p such that d(p+1) > d(q+1) for all lessers of twin primes q < p, where d(n) is the number of divisors of n (A000005).

Original entry on oeis.org

3, 5, 11, 29, 59, 179, 239, 419, 1319, 2339, 3119, 3359, 6299, 7559, 21599, 21839, 33599, 35279, 42839, 55439, 100799, 110879, 287279, 415799, 957599, 1621619, 1713599, 1867319, 1940399, 2489759, 3991679, 6652799, 11531519, 18258239, 22822799, 26732159, 28828799

Offset: 1

Amiram Eldar, Oct 12 2019

nonn

The corresponding values of d(p+1) are 3, 4, 6, 8, 12, 18, 20, 24, 32, 36, 40, 48, 54, 64, 72, 80, 84, 90, 96, 120, 126, 144, 160, 192, 216, 240, 252, 256, 270, 288, 320, 384, 432, 448, 480, 512, 576, ...

Cf. A000005, A001359, A068507, A321995, A326392.

dm = DivisorSigma[0, 4]; s = {3}; Do[If[!PrimeQ[6n - 1] || !PrimeQ[6n + 1], Continue[]]; d = DivisorSigma[0, 6n]; If[d > dm, dm = d; AppendTo[s, 6n - 1]], {n, 1, 10^5}]; s

A370355 Highly touchable numbers sandwiched between untouchable twin pairs.

Original entry on oeis.org

1681, 5251, 7771, 36961, 39271, 170941, 196351, 360361, 510511, 1009471, 9699691

Offset: 1

Amiram Eldar, Feb 16 2024

Highly touchable numbers k have a record number of solutions x to A001065(x) = k, while untouchable numbers k have no solution to this equation.

Intersection of A238895 and {A231964(n) + 1};
Cf. A001065, A005114.
Similar sequences: A068507, A113839.

seq[nmax_] := Module[{v = Table[0, {nmax}], i, s = {}, vmax = -1}, Do[i = DivisorSigma[1, n] - n; If[0 < i <= nmax, v[[i]]++], {n, 1, nmax^2}]; Do[If[v[[n]] > vmax, vmax = v[[n]]; If[v[[n - 1]] == 0 && v[[n + 1]] == 0, AppendTo[s, n]]], {n, 2, nmax - 1}]; s]; seq[8000]

cp's OEIS Frontend

A002182 Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A014574 Average of twin prime pairs.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

Maxima

PARI

Formula

Extensions

A072828 Primes p such that p+1 is a highly composite number.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

A321995 Indices of highly composite numbers A002182 which are between a twin prime pair.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Formula

Extensions

A353302 Numbers k such that A004394(k)-1 and A004394(k)+1 are twin primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A375197 Terms k in A025487 such that k-1 and k+1 are twin primes.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A340580 Ramanujan's highly composite numbers A002182 sandwiched between nonprimes.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions