login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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

Table of n, a(n) for n=1..5.

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 A280537 A022413

Adjacent sequences:  A087277 A087278 A087279 * A087281 A087282 A087283

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 20:57 EST 2020. Contains 338755 sequences. (Running on oeis4.)