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!)
A281818 a(n) is the least number k such that sigma(n) + sigma(k) = sigma(abs(n-k)), or -1 if such a number does not exist. 1
5, 130, 13, 104, 1, 71, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(8) > 10^14 unless a(8) = -1. (It's relatively easy to test because k needs to be a square or twice a square.) - Charles R Greathouse IV , Feb 03 2017
LINKS
EXAMPLE
a(1) = 5 because 5 is the least number such that sigma(1) + sigma(5) = 1 + 6 = 7 = sigma(5-1).
MAPLE
with(numtheory): P:= proc(q) local k, n; for n from 1 to q do for k from 1 to q do
if sigma(n)+sigma(k)=sigma(abs(n-k)) then print(k); break; fi;
od; if k=q+1 then print(-1); fi; od; end: P(10^6);
MATHEMATICA
Table[SelectFirst[Range[10^6], DivisorSigma[1, n] + DivisorSigma[1, #] == DivisorSigma[1, Abs[n - #]] &] /. k_ /; MissingQ@ k -> -1, {n, 58}] (* Michael De Vlieger, Feb 01 2017, Version 10.2 *)
CROSSREFS
Cf. A000203.
Sequence in context: A012187 A012083 A012226 * A332317 A069078 A003732
KEYWORD
sign,more
AUTHOR
Paolo P. Lava, Jan 31 2017
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 April 25 11:29 EDT 2024. Contains 371967 sequences. (Running on oeis4.)