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.

A324255 Lesser of super amicable pair m < n defined by sigma(sigma(m)) = sigma(sigma(n)) = m + n.

This page as a plain text file.
%I A324255 #10 Mar 01 2019 03:00:56
%S A324255 23,14999,34673,55373,2056961,2458187,4586987,5174363,6204767,
%T A324255 15788453,20699927,22239647,25748273,43428947,53636627,74005637,
%U A324255 92626307,132253139,134131379,158486747,167677187,183614987,307412933,385042487,413859143,418168343,683772017
%N A324255 Lesser of super amicable pair m < n defined by sigma(sigma(m)) = sigma(sigma(n)) = m + n.
%C A324255 The larger numbers in each pair are in A324256.
%C A324255 Analogous to A002025 as A019279 is analogous to A000396.
%e A324255 (23, 37) are the first pair since sigma(sigma(23)) = sigma(sigma(37)) = 60 = 23 + 37.
%t A324255 seq={}; s[n_]:=DivisorSigma[1,DivisorSigma[1,n]]-n; Do[m=s[n];If[m>n && s[m]==n, AppendTo[seq, n]], {n,1,60000}]; seq
%o A324255 (PARI) f(n) = sigma(sigma(n)) - n;
%o A324255 lista(nn) = {for (n=1, nn, my(fn = f(n)); if ((fn > n) && (f(fn) == n), print1(n, ", ")););} \\ _Michel Marcus_, Feb 20 2019
%Y A324255 Cf. A000203, A000396, A002025, A019279, A045613 (unitary analog), A051027, A324256.
%K A324255 nonn
%O A324255 1,1
%A A324255 _Amiram Eldar_, Feb 19 2019