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.

A185288 Numbers n for which the terms of the multiplicative sequence {n^2/A049417(n)} are integers.

This page as a plain text file.
%I A185288 #18 Jul 21 2019 06:26:17
%S A185288 1,6,60,90,120,180,360,540,816,840,1080,1740,1980,2280,2520,3060,3960,
%T A185288 5712,6120,8280,9540,11880,12240,16920,18360,19260,24480,25296,25560,
%U A185288 32760,36720,42840,48960,54672,57240,63700,73440,74256,84360,85680,97920,103320,115560
%N A185288 Numbers n for which the terms of the multiplicative sequence {n^2/A049417(n)} are integers.
%C A185288 The sequence contains all infinitary perfect numbers (see A007357).
%H A185288 Amiram Eldar, <a href="/A185288/b185288.txt">Table of n, a(n) for n = 1..1000</a>
%e A185288 Let n=120. Its representation over distinct terms of A050376 is 2*3*4*5. Therefore A049417(n)=(2+1)*(3+1)*(4+1)*(5+1)=360. Since 360 is a divisor of 120^2, 120 is in the sequence.
%t A185288 fun[p_, e_] := Module[{b = IntegerDigits[e, 2]}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ fun @@@ FactorInteger[n]; aQ[n_] := Divisible[n^2, isigma[n]]; Select[Range[58000], aQ] (* _Amiram Eldar_, Jul 21 2019 *)
%Y A185288 Cf. A007357, A049417, A064380, A185079, A185088, A185098, A185373, A185383.
%K A185288 nonn
%O A185288 1,2
%A A185288 _Vladimir Shevelev_, Feb 20 2011
%E A185288 More terms from _Nathaniel Johnston_, Mar 16 2011
%E A185288 More terms from _Amiram Eldar_, Jul 21 2019