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!)
A178542 Difference A063990(2n)-A063990(2n-1) between amicable numbers. 0

%I #2 Mar 30 2012 17:34:41

%S 64,26,304,544,136,112,2310,1120,3908,103,1530,3666,1097,21780,784,

%T 15660,646,15554,4416,4512,11356,988,28080,36858,24840,30810,17888,

%U 17150,11680,3510,9536,11440,9328,1724,5184,13888,13140,61110,18504

%N Difference A063990(2n)-A063990(2n-1) between amicable numbers.

%C Note that these are not differences between two members of amicable pairs

%C (see A066539) because A063990 is sorted and may separate pairs of amicable numbers.

%t (*A063990 Amicable numbers.*);

%t s[n_] := DivisorSigma[1, n] - n;

%t AmicableNumberQ[n_] := If[Nest[s, n, 2] == n && ! s[n] == n, True, False];

%t a = Select[Range[10^6], AmicableNumberQ[ # ] &];

%t Table[a[[n + 1]] - a[[n]], {n, 1, Length[a], 2}]

%Y Cf. A063990.

%K nonn

%O 1,1

%A _Roger L. Bagula_, May 29 2010

%E Formula clarified by the Assoc. Eds. of the OEIS - Jun 07 2010

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 23 10:21 EDT 2024. Contains 371905 sequences. (Running on oeis4.)