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!)
A217704 Smallest number k > n for which sigma(k-n) = sigma(k+n). 1

%I #23 Feb 25 2018 20:45:59

%S 34,53,23,19,26,41,31,38,49,52,68,82,112,80,103,76,110,123,166,83,101,

%T 136,219,164,130,186,147,133,381,254,208,149,253,169,131,246,172,332,

%U 404,166,245,312,148,209,309,241,487,328,217,260

%N Smallest number k > n for which sigma(k-n) = sigma(k+n).

%C The sigma() in the definition is the sum-of-divisors function A000203.

%H Andrew Howroyd, <a href="/A217704/b217704.txt">Table of n, a(n) for n = 1..10000</a>

%e a(26)=186 because sigma(186-26)=sigma(160)=378=sigma(212)=sigma(186+26) and there is no k such that 26<k<186 for which sigma(k-26)=sigma(k+26).

%t Table[Min[Select[Range[500],DivisorSigma[1, # - n] == DivisorSigma[1, # + n] && # > n &]], {n,50}]

%o (PARI) a(n)={my(k=n+1); while(sigma(k-n)<>sigma(k+n), k++); k} \\ _Andrew Howroyd_, Feb 25 2018

%Y Cf. A217768.

%K nonn

%O 1,1

%A _Jayanta Basu_, Mar 26 2013

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 19 02:04 EDT 2024. Contains 371782 sequences. (Running on oeis4.)