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.

A346695 Numbers with more divisors than digits in their binary representation.

This page as a plain text file.
%I A346695 #23 Jun 24 2023 09:23:10
%S A346695 6,12,18,20,24,28,30,36,40,42,48,54,56,60,66,70,72,78,80,84,88,90,96,
%T A346695 100,102,104,105,108,110,112,114,120,126,132,140,144,150,156,160,162,
%U A346695 168,176,180,192,196,198,200,204,208,210,216,220,224,225,228,234,240,252,260
%N A346695 Numbers with more divisors than digits in their binary representation.
%C A346695 Not all terms are perfect or abundant, with 105 being the first deficient term.
%C A346695 There are no primes in the sequence, and 6 is the only semiprime.
%C A346695 By the same comments as those at A175495, this sequence is infinite.
%C A346695 This sequence is a subsequence of A175495.
%C A346695 It is natural to conjecture that this sequence has asymptotic density 0. However, after the first three terms where a(n)/n = 6 -- a function which would increase to infinity if the asymptotic density were zero -- it drops, and it seems to take a long time to get that high again. The first time it gets above 5.0 is at a(30243)=151216. Even as high as a(2188516)=10000000, the density is only ~1/4.57.
%C A346695 The number of terms with m binary digits is Sum_{k>m} A346730(m,k). - _Jon E. Schoenfield_, Jul 31 2021
%e A346695 12 has 6 divisors: {1,2,3,4,6,12}. 12 is written in binary as 1100, which has 4 digits. Since 6 > 4, 12 is in the sequence.
%t A346695 Select[Range[1000], (DivisorSigma[0, #] > Floor[1 + Log2[#]]) &]
%o A346695 (PARI) isok(m) = numdiv(m) > #binary(m); \\ _Michel Marcus_, Jul 29 2021
%o A346695 (Python)
%o A346695 from sympy import divisor_count
%o A346695 def ok(n): return divisor_count(n) > n.bit_length()
%o A346695 print(list(filter(ok, range(1, 261)))) # _Michael S. Branicky_, Jul 29 2021
%Y A346695 Cf. A000005, A070939.
%Y A346695 Cf. A135772 (equal number rather than more).
%Y A346695 Cf. A175495 (where "binary digits in n" is replaced by "log_2(n)").
%K A346695 nonn,base,easy
%O A346695 1,1
%A A346695 _Alex Meiburg_, Jul 29 2021