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!)
A137532 a(n) is the smallest positive integer k such that d(k) = d(k+n) = 2*n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists. 1
2, 6, 172, 66, 15952, 84, 22592, 888, 2196, 3750, 459932661, 660, 86817796083, 185152, 143366096, 5304, 17685013528576, 3150, 1786574475624429, 1272510, 29059703104, 12872682, 4817557477673402368, 9576, 85608255863, 15744471040, 1179648, 124718750, 1765038427619364800823267 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(PARI) lq080419b(n, a)=n*=2; until(0, numdiv(a++)==n || next; numdiv(a+n\2)==n && break); a
for(i=1, 99, print1(lq080419b(i)", "))
CROSSREFS
Sequence in context: A168649 A135937 A182523 * A072116 A203430 A298883
KEYWORD
nonn
AUTHOR
M. F. Hasler, Apr 19 2008
EXTENSIONS
a(11) from Jacques Tramu, Apr 20 2008
More terms from Jinyuan Wang, May 08 2021
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)