cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A161005 Sums of adjacent amicable numbers, a(n) = A063990(2n-1) + A063990(2n).

This page as a plain text file.
%I A161005 #33 Oct 29 2017 13:11:04
%S A161005 504,2394,5544,10584,12600,21600,26880,35712,129948,134087,140760,
%T A161005 155834,176363,222750,245520,263970,283974,321906,348128,357184,
%U A161005 382092,405876,589160,675958,755008,829994,892800,955206,1017792,1048320
%N A161005 Sums of adjacent amicable numbers, a(n) = A063990(2n-1) + A063990(2n).
%C A161005 Warning: The numbers being summed will not always belong to the same amicable pair. See A180164 for the sums of amicable pairs. - _Jeppe Stig Nielsen_, Jan 27 2015
%H A161005 T. D. Noe, <a href="/A161005/b161005.txt">Table of n, a(n) for n=1..1000</a>
%e A161005 a(1) = 504 = 220 + 284.
%e A161005 a(2) = 2394 = 1184 + 1210.
%e A161005 a(3) = 5544 = 2620 + 2694.
%t A161005 s[n_] := DivisorSigma[1, n] - n;
%t A161005 AmicableNumberQ[n_] := If[Nest[s, n, 2] == n && ! s[n] == n, True, False];
%t A161005 a = Select[Range[10^6], AmicableNumberQ[ # ] &];
%t A161005 Table[a[[n + 1]] + a[[n]], {n, 1, Length[a], 2}]
%t A161005 (* _Roger L. Bagula_, May 29 2010, based on _Ant King_'s Mathematica program from A063990 *)
%Y A161005 Cf. A063990, A259180.
%K A161005 nonn,less
%O A161005 1,1
%A A161005 _Claudio Meller_, Jun 01 2009
%E A161005 Corrected and extended by _Roger L. Bagula_, May 29 2010
%E A161005 Edited by _N. J. A. Sloane_, Aug 14 2010, at the suggestion of _Jason G. Wurtzel_