A030634 -id:A030634 - cp's OEIS frontend

A137487 Numbers with 24 divisors.

360, 420, 480, 504, 540, 600, 630, 660, 672, 756, 780, 792, 864, 924, 936, 990, 1020, 1050, 1056, 1092, 1120, 1140, 1152, 1170, 1176, 1188, 1224, 1248, 1350, 1368, 1380, 1386, 1400, 1404, 1428, 1470, 1500, 1530, 1540, 1596, 1632, 1638, 1650, 1656, 1710

Offset: 1

R. J. Mathar, Apr 22 2008

nonn

Maple implementation: see A030513.

Numbers of the form p^23, p^2*q^7, p*q^2*r^3 (like 360, 504), p*q*r^5 (like 480, 672), p*q*r*s^2 (like 420, 660), p^3*q^5 (like 864) or p*q^11, where p, q, r and s are distinct primes. - R. J. Mathar, Mar 01 2010

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A030513-A030516, A030626, A030627, A030634-A030638, A005179, A003680, A096932, A061286, A061283.

Select[Range[3000],DivisorSigma[0,#]==24&] (* Vladimir Joseph Stephan Orlovsky, May 05 2011 *)

is(n)=numdiv(n)==24 \\ Charles R Greathouse IV, Jun 19 2016

A000005(a(n))=24.

A137489 Numbers with 26 divisors.

Original entry on oeis.org

12288, 20480, 28672, 45056, 53248, 69632, 77824, 94208, 118784, 126976, 151552, 167936, 176128, 192512, 217088, 241664, 249856, 274432, 290816, 299008, 323584, 339968, 364544, 397312, 413696, 421888, 438272, 446464, 462848, 520192, 536576

Offset: 1

R. J. Mathar, Apr 22 2008

nonn

Maple implementation: see A030513.

Numbers of the form p^25 (5th powers of A050997, subset of A010813) or p*q^12, where p and q are distinct primes. - R. J. Mathar, Mar 01 2010

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A030513-A030516, A030626, A030627, A030634-A030638, A005179, A003680, A096932, A061286, A061283.

Select[Range[900000],DivisorSigma[0,#]==26&] (* Vladimir Joseph Stephan Orlovsky, May 05 2011 *)

is(n)=numdiv(n)==26 \\ Charles R Greathouse IV, Jun 19 2016

A000005(a(n))=26.

A274359 Numbers n such that n and n+1 both have 16 divisors.

Original entry on oeis.org

2295, 3255, 4185, 5480, 5642, 5655, 6104, 6279, 6344, 6669, 6783, 7160, 7314, 7749, 8294, 8295, 8645, 9176, 9344, 9624, 10184, 10664, 10695, 10856, 10934, 10989, 11319, 11528, 11570, 12440, 13034, 13064, 13208, 13310, 13629, 13695, 13845, 13959

Offset: 1

Charles R Greathouse IV, Jun 19 2016

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Intersection of A005237 and A030634.

Cf. A000005, A274357.

PARI
```
is(n)=numdiv(n)==16 && numdiv(n+1)==16
```

A276307 Primes p such that d(p*(2p+1)) = 16 where d(n) is the number of divisors of n (A000005).

Original entry on oeis.org

67, 97, 127, 199, 227, 229, 241, 277, 307, 313, 331, 379, 397, 457, 467, 499, 547, 617, 619, 647, 709, 727, 739, 757, 773, 797, 823, 829, 857, 883, 977, 1033, 1069, 1093, 1117, 1123, 1171, 1187, 1193, 1201, 1277, 1297, 1303, 1319, 1423, 1447, 1459, 1471, 1483, 1609

Offset: 1

Anthony Hernandez, Aug 29 2016

nonn

Conjecture: this sequence is infinite.

Or, primes p such that d(2p+1)=8. - Zak Seidov, Sep 07 2016

			Consider 67. Then 67*(2*67+1) = 9045 and d(9045) = 16.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A005384, A030634, A276045, A276305.

[n: n in [0..2000] | NumberOfDivisors(2*n+1) eq 8 and IsPrime(n)]; // Vincenzo Librandi, Aug 30 2016

Select[Prime@ Range@ 256, DivisorSigma[0, # (2 # + 1)] == 16 &] (* Michael De Vlieger, Aug 30 2016 *)

lista(nn) = forprime (p=2, nn, if (numdiv(p*(2*p+1)) == 16, print1(p, ", "))); \\ Michel Marcus, Aug 29 2016

is(n)=numdiv(2*n+1)==8 && isprime(n) \\ Charles R Greathouse IV, Aug 29 2016

Corrected and extended by Michel Marcus, Aug 29 2016

A137490 Numbers with 27 divisors.

Original entry on oeis.org

900, 1764, 2304, 4356, 4900, 6084, 6400, 10404, 11025, 12100, 12544, 12996, 16900, 19044, 23716, 26244, 27225, 28900, 30276, 30976, 33124, 34596, 36100, 38025, 43264, 49284, 52900, 53361, 56644, 60516, 65025, 66564, 70756, 73984, 74529

Offset: 1

R. J. Mathar, Apr 22 2008

nonn

Maple implementation: see A030513.

Numbers of the form p^26 (subset of A089081), p^2*q^2*r^2 (like 900, 1764, 4356, squares of A007304) or p^2*q^8 (like 2304, 6400, subset of the squares of A030628) where p, q and r are distinct primes. - R. J. Mathar, Mar 01 2010

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A000005, A030513-A030516, A030626, A030627, A030634-A030638, A005179, A003680, A096932, A061286, A061283.

Select[Range[150000],DivisorSigma[0,#]==27&] (* Vladimir Joseph Stephan Orlovsky, May 06 2011 *)

isA137490(n) = numdiv(n)==27 \\ Michael B. Porter, Apr 10 2010

A000005(a(n)) = 27.

Sum_{n>=1} 1/a(n) = (P(2)^3 + 2*P(6) - 3*P(2)*P(4))/6 + P(2)*P(8) - P(10) + P(26) = 0.00453941..., where P is the prime zeta function. - Amiram Eldar, Jul 03 2022

A307980 Numbers k whose number of divisors is the square of the number of decimal digits of k.

Original entry on oeis.org

1, 10, 14, 15, 21, 22, 26, 27, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 100, 196, 225, 256, 441, 484, 676, 1000, 1026, 1032, 1064, 1110, 1122, 1128, 1144, 1155, 1160, 1190, 1218, 1230, 1240, 1242, 1254, 1272, 1288, 1290, 1302, 1326, 1330, 1365, 1408

Offset: 1

Bernard Schott, May 08 2019

The terms with an odd number of digits are squares.
The terms with 2 digits are squarefree semiprimes (cf. A006881) Union {27}. The terms with 3 digits belong to A030627 (numbers with 9 divisors) and the ones with 4 digits belong to A030634 (numbers with 16 divisors).
The number of terms b(n) with n digits begins with: 1, 30, 7, 753, 3, 11409, 2, ... When there are an odd number of digits, the number of terms decreases from b(3) = 7, b(5) = 3, b(7) = 2. Is there a 2q+1 such that b(2q+1) = 0?
The sequence is infinite because 10^k is the term for each k. We have tau(10^k) = tau(2^k)*tau(5^k) = (k + 1)^2 and 10^k has k + 1 digits. - Marius A. Burtea, May 09 2019
a(n) >= 1, for any n, so b(2q+1)>= 1 for any q. - Marius A. Burtea, May 09 2019

			65 is a term with 2 digits and 4 divisors: {1, 5, 13, 65}.
484 is a term with 3 digits and 9 divisors: {1, 2, 4, 11, 22, 44, 121, 242, 484}.

Sean A. Irvine, Java program (github)

Cf. A095862 (number of decimal digits = number of divisors).
Cf. A006881 (squarefree semiprimes).
Cf. A030513 (numbers with 4 divisors), A030627 (numbers with 9 divisors), A030634 (numbers with 16 divisors).
Cf. A011557 (subsequence).

[n:n in [1..1500]|NumberOfDivisors(n) eq (#Intseq(n))^2]; // Marius A. Burtea, May 09 2019

is(n) = numdiv(n) == #digits(n)^2 \\ David A. Corneth, May 08 2019

A350767 a(1)=1. Thereafter, a(n+1) is the least unused number k such that either d(j(n)) properly divides d(k) or d(k) properly divides d(j(n)), where j(n) = a(n)+1 and d is the divisor counting function A000005.

Original entry on oeis.org

1, 6, 8, 12, 10, 14, 2, 15, 48, 18, 20, 3, 28, 21, 5, 7, 11, 4, 22, 24, 32, 13, 17, 9, 19, 23, 26, 29, 27, 25, 30, 33, 31, 37, 40, 34, 41, 35, 49, 43, 47, 16, 38, 42, 39, 46, 44, 53, 51, 59, 45, 54, 56, 60, 50, 61, 66, 52, 55, 57, 67, 71, 58, 62, 72, 63, 192, 65

Offset: 1

David James Sycamore, Jan 14 2022

nonn

If d(j(n)) is prime p then d(a(n+1)) must be properly divisible by p. In practice the proper divisor for computation of a(n+1) toggles between d(j(n)) and d(k).
Conjecture: This is a permutation of the positive integers. Numbers with the same number (tau) of divisors appear in their natural orders (e.g., primes, semiprimes, squares).
The plot, after the first few terms, resolves itself into points tightly packed on and around a straight line of slope 1, with exceptional points appearing as significant upward or downward "spikes".
When d(j(n)) is prime p appearing for the first time in the sequence J = {d(j(a(n)), n>=1}, then a(n+1) is the smallest number with 2p divisors, which produces a significantly large upward spike above the straight line (6, 12, 48, 192, 3072, 12288, ...).
When d(j(a(n)) is 2p, seen for the first time in J, then a(n+1) is the smallest number with p divisors, which produces a large downward spike, below the straight line (2, 4, 16, 64, 1024, 4096, ...).
The sequence of fixed points starts: 1, 46, 69, 74, 110, 140, 142, 152, 154, 178, ... apparently becoming denser as n increases.

			a(1)=1, so j(1)=2, d(j(1))=2, a prime, so we need the smallest unused k such that d(k) is properly divisible by 2, hence a(2)=6.
a(2)=6, j(2)=4, d(j(2))=3, a prime so we need the smallest unused k such that d(k) is properly divisible by 3, hence a(3)=8.

Michael De Vlieger, Table of n, a(n) for n = 1..10001
Michael De Vlieger, Scatterplot of a(n), n = 1..256, color coded to show primes in red, evens in blue, 2 in magenta, odd composites in black. A gold highlight indicates terms such that (a(n)+1) | a(n+1). Outlying points are annotated.
Michael De Vlieger, Log-log scatterplot of a(n), n = 1..2^16. Terms in A3680(p) such that p is prime appear annotated in red, and those in A061286 appear in blue.

Cf. A000040, A001248, A030514, A054753, A030516, A030626, A085986, A178739, A030629, A030630, A030631, A030632, A030633, A030634, A005179, A061286, A003680.

Block[{c, d, j, k, u, nn}, nn = 120; j = u = 2; c[] = 0; c[1] = 1; Do[d[i] = DivisorSigma[0, i], {i, 2^(Ceiling@ Log2[nn] + 3)}]; {1}~Join~Reap[Do[k = u; While[Nand[Or[Divisible[d[j], d[k]], Divisible[d[k], d[j]]], d[j] != d[k], c[k] == 0], k++]; Sow[k]; c[k] = i; j = k + 1; If[k == u, While[c[u] != 0, u++]], {i, nn}] ][[-1, -1]] ] (* _Michael De Vlieger, Jan 14 2022 *)

isok(k, last, set) = if (!setsearch(set, k), my(ndk=numdiv(k), ndl=numdiv(last+1)); (ndl != ndk) && ((!(ndk % ndl)) || (!(ndl % ndk))));
lista(nn) = {my(last = 1, list = List(last), set = Set(list)); for (n=2, nn, my(k=1); while (!isok(k, last, set), k++); listput(list, k); set = Set(list); last = k;); Vec(list);} \\ Michel Marcus, Jan 15 2022

More terms from Michael De Vlieger, Jan 14 2022

cp's OEIS Frontend

A137487 Numbers with 24 divisors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A137489 Numbers with 26 divisors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A274359 Numbers n such that n and n+1 both have 16 divisors.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A276307 Primes p such that d(p*(2p+1)) = 16 where d(n) is the number of divisors of n (A000005).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Extensions

A137490 Numbers with 27 divisors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A307980 Numbers k whose number of divisors is the square of the number of decimal digits of k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

PARI

A350767 a(1)=1. Thereafter, a(n+1) is the least unused number k such that either d(j(n)) properly divides d(k) or d(k) properly divides d(j(n)), where j(n) = a(n)+1 and d is the divisor counting function A000005.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions