A356743 -id:A356743 - cp's OEIS frontend

A356742 Numbers k such that k and k+2 both have exactly 4 divisors.

6, 8, 33, 55, 85, 91, 93, 123, 141, 143, 159, 183, 185, 201, 203, 213, 215, 217, 219, 235, 247, 265, 299, 301, 303, 319, 321, 327, 339, 341, 391, 393, 411, 413, 415, 445, 451, 469, 471, 515, 517, 533, 535, 543, 551, 579, 581, 589, 633, 667, 669, 679, 685, 687, 695, 697

Offset: 1

Jianing Song, Aug 25 2022

nonn

6 and 8 are the only even terms: one of the two consecutive even numbers is divisible by 4, and the only multiple of 4 with exactly 4 divisors is 8.

			341 is a term since 341 and 343 both have 4 divisors.

Jianing Song, Table of n, a(n) for n = 1..10000

Numbers k such that k and k+2 both have exactly m divisors: A001359 (m=2), this sequence (m=4), A356743 (m=6), A356744 (m=8).

Cf. also A039832 (numbers k such that k and k+1 both have exactly 4 divisors).

SequencePosition[DivisorSigma[0,Range[700]],{4,,4}][[All,1]] (* _Harvey P. Dale, Oct 07 2022 *)

isA356742(n) = numdiv(n)==4 && numdiv(n+2)==4

A356766 Least number k such that k and k+2 both have exactly 2n divisors, or -1 if no such number exists.

Original entry on oeis.org

3, 6, 18, 40, 127251, 198, 26890623, 918, 17298, 6640, 25269208984375, 3400, 3900566650390623, 640062, 8418573, 18088, 1164385682220458984373, 41650, 69528379848480224609373, 128464, 34084859373, 12164094, 150509919493198394775390625, 90270, 418514293125, 64505245696

Offset: 1

Jean-Marc Rebert, Aug 26 2022

nonn

			For n=1, numdiv(3) = numdiv(5) = 2 = 2*1, and no number < 3 satisfies this, hence a(1) = 3.

Numbers k such that k and k+2 both have exactly m divisors: A001359 (m=2), A356742 (m=4), A356743 (m=6), A356744 (m=8).

Cf. A000005 (d(n)), A003680, A005238, A006558, A006601, A062832, A067888, A067889, A075036.

a={}; n=1; nmax=10; For[k=1, n<=nmax, k++, If[DivisorSigma[0, k] == DivisorSigma[0, k+2] == 2n, AppendTo[a, k]; k=1; n++]]; a (* Stefano Spezia, Aug 26 2022 *)
Flatten[Table[SequencePosition[DivisorSigma[0,Range[27*10^6]],{2n,,2n},1],{n,10}],1][[;;,1]] (* The program generates the first 10 terms of the sequence. To generate more, increase the Range constant but the program will take a long time to run. *) (* _Harvey P. Dale, Jul 01 2023 *)

a(n)=for(k=1,+oo,if(numdiv(k)==2*n&&numdiv(k+2)==2*n,return(k)))

More terms from Jinyuan Wang, Aug 28 2022

cp's OEIS Frontend

A356742 Numbers k such that k and k+2 both have exactly 4 divisors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI