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.

A293188 Unitary pseudoperfect numbers: numbers that equal to the sum of a subset of their aliquot unitary divisors.

This page as a plain text file.
%I A293188 #17 Feb 18 2021 00:22:36
%S A293188 6,30,42,60,66,78,90,102,114,138,150,174,186,210,222,246,258,282,294,
%T A293188 318,330,354,366,390,402,420,426,438,462,474,498,510,534,546,570,582,
%U A293188 606,618,630,642,654,660,678,690,714,726,750,762,770,780,786,798,822
%N A293188 Unitary pseudoperfect numbers: numbers that equal to the sum of a subset of their aliquot unitary divisors.
%C A293188 Supersequence of A002827.
%C A293188 The nonsquarefree terms are 60, 90, 150, 294, 420, 630, 660, 726, 750, 780, 840, ...
%H A293188 Amiram Eldar, <a href="/A293188/b293188.txt">Table of n, a(n) for n = 1..10000</a>
%e A293188 150 is in the sequence since its unitary aliquot divisors are 1, 2, 3, 6, 25, 50, 75 and 150 = 25 + 50 + 75.
%t A293188 udiv[n_]:=Block[{d=Divisors[n]},Select[d,GCD[#,n/#]==1&]]; a={};n=0;While[Length[a]<100,n++;d=Most[udiv[n]];c = SeriesCoefficient[ Series[ Product[1+x^d[[i]],{i,Length[d]} ],{x,0,n}], n]; If[c>0,AppendTo[a,n]]];a (* after _T. D. Noe_ at A005835 *)
%Y A293188 Cf. A002827, A005835, A034683, A064114.
%K A293188 nonn
%O A293188 1,1
%A A293188 _Amiram Eldar_, Oct 01 2017