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.

A327165 Numbers n that have a divisor d such that sigma(d)*d is equal to n.

This page as a plain text file.
%I A327165 #13 Sep 28 2019 22:18:43
%S A327165 1,6,12,28,30,56,72,117,120,132,180,182,306,336,360,380,496,552,672,
%T A327165 702,775,792,840,870,992,1080,1092,1406,1440,1568,1584,1680,1722,1836,
%U A327165 1892,2016,2160,2184,2256,2280,2793,2862,3276,3312,3510,3540,3600,3672,3696,3782,3960,4032,4556,4560,4650,5096,5112,5220
%N A327165 Numbers n that have a divisor d such that sigma(d)*d is equal to n.
%C A327165 Numbers n for which A327153(n) > 0.
%C A327165 Sequence A064987 sorted into ascending order, with duplicates removed.
%C A327165 All even terms of A000396 occur here.
%H A327165 Antti Karttunen, <a href="/A327165/b327165.txt">Table of n, a(n) for n = 1..10001</a>
%o A327165 (PARI) isA327165(n) = { fordiv(n, d, if(n==d*sigma(d),return(1))); (0); };
%o A327165 (PARI) A327165list(up_to) = { my(res = List()); for(i = 1, sqrtint(up_to), c = i*sigma(i); if(c <= up_to, listput(res, c))); listsort(res, 1); Vec(res); }; \\ From _David A. Corneth_, Sep 18 2019
%Y A327165 Cf. A000203, A000396, A064987, A327153, A327599 (subsequence of odd terms).
%K A327165 nonn
%O A327165 1,2
%A A327165 _Antti Karttunen_, Sep 18 2019