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.

A380931 Numbers k such that A380845(k) > 4*k.

This page as a plain text file.
%I A380931 #8 Feb 10 2025 01:41:28
%S A380931 5155920,7733880,10311840,15467760,20623680,30935520,41247360,
%T A380931 46403280,61871040,61901280,75546240,82494720,87693480,92806560,
%U A380931 103168800,103194000,113513400,123742080,123802560,134152200,140540400,151092480,151351200,162162000,164989440,175386960
%N A380931 Numbers k such that A380845(k) > 4*k.
%C A380931 Analogous to 4-abundant numbers (A068404) with A380845 instead of A000203.
%H A380931 Amiram Eldar, <a href="/A380931/b380931.txt">Table of n, a(n) for n = 1..1000</a>
%e A380931 5155920 is a term since A380845(5155920) = 21067042 > 4 * 5155920 = 20623680.
%t A380931 q[k_] := Module[{h = DigitCount[k, 2, 1]}, DivisorSum[k, # &, DigitCount[#, 2, 1] == h &] > 4*k]; Select[Range[10^8], q]
%o A380931 (PARI) isok(k) = {my(h = hammingweight(k)); sumdiv(k, d, d*(hammingweight(d) == h)) > 4*k;}
%Y A380931 Cf. A000203, A380845, A380846, A380847, A380848.
%Y A380931 Subsequence of A068404, A380929 and A380931.
%Y A380931 Similar sequences: A307114, A340110.
%K A380931 nonn,base
%O A380931 1,1
%A A380931 _Amiram Eldar_, Feb 08 2025