login
This site is supported by donations 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; 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.

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: A065528 A050936 A084146 * A022413 A078781 A022160

Adjacent sequences:  A087277 A087278 A087279 * A087281 A087282 A087283

KEYWORD

nonn

AUTHOR

Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Aug 28 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:30 EST 2012. Contains 205971 sequences.