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.

A280353 Numbers n such that the sum of the divisors of n divides sum of squares of divisors of n and number of divisors of n divides n.

This page as a plain text file.
%I A280353 #13 Nov 27 2024 18:20:19
%S A280353 1,9,36,180,225,441,450,468,625,1089,1476,1521,1620,1800,2025,2178,
%T A280353 2340,2601,3249,3600,4050,4500,4761,5202,5625,6561,7569,8100,8649,
%U A280353 8712,9522,10000,12321,13572,15129,15138,16200,16641,19881,20808,22500,23400,25281,26244,28224,28800
%N A280353 Numbers n such that the sum of the divisors of n divides sum of squares of divisors of n and number of divisors of n divides n.
%C A280353 Intersection of A020487 and A033950.
%C A280353 Numbers n such that A000203(n)|A001157(n) and A000005(n)|n.
%H A280353 Amiram Eldar, <a href="/A280353/b280353.txt">Table of n, a(n) for n = 1..10000</a>
%H A280353 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%e A280353 9 is in the sequence because 9 has 3 divisors {1,3,9}, 9/3 = 3 and (1^2 + 3^2 + 9^2)/(1 + 3 + 9) = 7 are both integer.
%t A280353 Select[Range[30000], Divisible[DivisorSigma[2, #1], DivisorSigma[1, #1]] && Divisible[#1, DivisorSigma[0, #1]] & ]
%t A280353 Select[Range[30000],With[{ds=DivisorSigma},Mod[ds[2,#],ds[1,#]]==Mod[#,ds[0,#]]==0&]] (* _Harvey P. Dale_, Nov 27 2024 *)
%Y A280353 Cf. A000005, A000203, A001157, A020487, A033950.
%K A280353 nonn,easy
%O A280353 1,2
%A A280353 _Ilya Gutkovskiy_, Jan 01 2017