Authors: Richard J. Mathar
The Number-of-Divisors Function tau(n) is the number of divisors of a positive integer n, including 1 and n itself. Searching for pairs of the format (tau(n), tau(n+1)), some pairs appear (very) often, some never and some --- like (1,2), (4,9), or (10,3) --- exactly once. The manuscript provides proofs for 46 pairs to appear exactly once and lists 12 pairs that conjecturally appear only once. It documents a snapshot of a community effort to verify sequence A161460 of the Online Encyclopedia of Integer Sequences that started ten years ago.
Comments: 39 Pages.
[v1] 2019-11-17 08:18:55
Unique-IP document downloads: 8 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.