cp's OEIS Frontend

A104149 Numbers k such that sigma(k+2) = sigma(k+1) + sigma(k).

%I A104149 #44 Feb 24 2024 01:10:25
%S A104149 1,2,22,1966,3262,5014,60454,1016506,4420162,12055510,14365606,
%T A104149 25726726,27896422,66562306,72764734,98734966,175186654,224868310,
%U A104149 253694926,288657202,386668342,421575406,504737746,630645454,1493547998,1653797794,2120325010,2221315150
%N A104149 Numbers k such that sigma(k+2) = sigma(k+1) + sigma(k).
%C A104149 Apparently all terms > 1 are even. - _Zak Seidov_, Mar 23 2015
%C A104149 For n <= 95, no a(n) is divisible by 3; a(2), a(25) and a(57) == 2 (mod 3), the rest == 1 (mod 3). - _Robert Israel_, Mar 23 2015
%H A104149 Giovanni Resta, <a href="/A104149/b104149.txt">Table of n, a(n) for n = 1..112</a> (terms < 10^13; first 50 terms from Donovan Johnson)
%F A104149 a(n) = A065900(n) - 2. - _R. J. Mathar_, Aug 19 2010
%F A104149 a(n) = A076530(n) - 1. - _M. F. Hasler_, Aug 19 2010
%e A104149 sigma(22) = 1+2+11+22 = 36.
%e A104149 sigma(23) = 1+23 = 24.
%e A104149 sigma(24) = 1+2+3+4+6+8+12+24 = 60.
%e A104149 sigma(24) = sigma(23) + sigma(22).
%t A104149 Select[Range@ 100000, DivisorSigma[1, # + 2] == DivisorSigma[1, # + 1] + DivisorSigma[1, #] &] (* _Michael De Vlieger_, Mar 23 2015 *)
%t A104149 Position[Partition[DivisorSigma[1,Range[3*10^7]],3,1],_?(#[[1]]+#[[2]]==#[[3]]&),1,Heads->False]//Flatten (* The program generates the first 13 terms *) (* _Harvey P. Dale_, May 08 2018 *)
%o A104149 (PARI) s1=1; s2=3; for(n=1, 10^8, s3=sigma(n+2); if(s3==s1+s2, print1(n ", ")); s1=s2; s2=s3) /* _Donovan Johnson_, Apr 08 2013 */
%o A104149 (Magma) [n: n in [1..2*10^6] | SumOfDivisors(n+2) eq (SumOfDivisors(n+1)+SumOfDivisors(n))]; // _Vincenzo Librandi_, Mar 24 2015
%K A104149 nonn
%O A104149 1,2
%A A104149 Neven Juric (neven.juric(AT)apis-it.hr), Aug 16 2010
%E A104149 More terms from _Zak Seidov_ and _R. J. Mathar_, Aug 19 2010