login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A356766 Least number k such that k and k+2 both have exactly 2n divisors, or -1 if no such number exists. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
For n=1, numdiv(3) = numdiv(5) = 2 = 2*1, and no number < 3 satisfies this, hence a(1) = 3.
MATHEMATICA
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 *)
PROG
(PARI) a(n)=for(k=1, +oo, if(numdiv(k)==2*n&&numdiv(k+2)==2*n, return(k)))
CROSSREFS
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).
Sequence in context: A081150 A362014 A216813 * A181037 A222856 A342583
KEYWORD
nonn
AUTHOR
Jean-Marc Rebert, Aug 26 2022
EXTENSIONS
More terms from Jinyuan Wang, Aug 28 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 09:46 EDT 2024. Contains 375035 sequences. (Running on oeis4.)