The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A087280 Solutions n of max(m+d(m))=n+2 for m<n; d(m) is the number of divisors of m. 0
5, 8, 10, 12, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It is not known if there are other terms. There are no more terms < 10^10.
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, section B8.
LINKS
Paul Erdos, Some Unconventional Problems in Number Theory, Mathematics Magazine, Vol. 52, No. 2, Mar., 1979, pp. 67-70. See Problem 4. p. 68.
EXAMPLE
The largest value of m+d(m) for m < n=8 is 6+d(6)=10 = n+2, so 8 is in the sequence.
CROSSREFS
Sequence in context: A332513 A314381 A325180 * A335495 A355569 A280537
KEYWORD
nonn,more
AUTHOR
Jud McCranie, Aug 28 2003
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 May 16 08:41 EDT 2024. Contains 372552 sequences. (Running on oeis4.)