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.

A244429 Nonprimes n such that the sum of proper divisors of n and the product of proper divisors of n are both perfect cubes.

This page as a plain text file.
%I A244429 #27 Aug 25 2019 05:58:26
%S A244429 1,56,568,1001,1431,3344,10688,17619,24099,37432,40797,46096,50571,
%T A244429 52687,55581,62375,75221,88863,97273,98752,111224,134672,235495,
%U A244429 247033,251403,266176,269072,271099,275077,299576,320489,333888,364067,372331,407319,534413,561008,614465,646691
%N A244429 Nonprimes n such that the sum of proper divisors of n and the product of proper divisors of n are both perfect cubes.
%C A244429 Primes trivially satisfy this property and are therefore not included in this sequence.
%C A244429 These numbers are in the intersection of A194948 and A229972.
%H A244429 Amiram Eldar, <a href="/A244429/b244429.txt">Table of n, a(n) for n = 1..1000</a>
%e A244429 The proper divisors of 56 are {1, 2, 4, 7, 8, 14, 28}. 1*2*4*7*8*14*28 = 175616 = 56^3. 1+2+4+7+8+14+28 = 64 = 4^3. Since both the product of proper divisors and the sum of proper divisors are cubes, 56 is a member of this sequence.
%o A244429 (PARI) for(n=1,10^7,d=divisors(n);s=sum(i=1,#d-1,d[i]);p=prod(j=1,#d-1,d[j]);if((p!=1||s!=1),if(ispower(s,3)&&ispower(p,3),print1(n,", "))))
%Y A244429 Cf. A244428, A064121, A229972, A194948.
%K A244429 nonn
%O A244429 1,2
%A A244429 _Derek Orr_, Jun 27 2014