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.

A095377 Values of k such that the total number of 1's in the binary expansions of the first k primes is a multiple of k.

This page as a plain text file.
%I A095377 #26 Jan 08 2025 17:02:14
%S A095377 1,4,14,43,46,141,4900,10264541,10281244,10281247,10281248,10281249,
%T A095377 10281266,10281271,10368575,531439030,1997778943,412276655628
%N A095377 Values of k such that the total number of 1's in the binary expansions of the first k primes is a multiple of k.
%C A095377 Integer solutions to {A095375(x)/x is an integer}.
%C A095377 a(18) > pi(10^12). - _Donovan Johnson_, May 03 2010
%C A095377 a(20) > 6.2*10^11. The first 19 ratios between the total number of 1's and k are 1, 2, 3, 4, 4, 5, 8, 14, 14, 14, 14, 14, 14, 14, 14, 17, 18, 22. - _Giovanni Resta_, May 08 2017
%F A095377 Integer solutions to {A095375(x)/x is an integer}.
%e A095377 n=14: the relevant list = {2,3,5...,41,43} = {10,11,101,...,11001,11011} contains 42 digits "1", and 42/14 = 3, so 14 is in the sequence.
%t A095377 s=0; Reap[Do[s += DigitCount[Prime@n, 2][[1]]; If[Mod[s, n] == 0, Sow@ n], {n, 10^4}]][[2, 1]] (* _Giovanni Resta_, May 08 2017 *)
%Y A095377 Cf. A000120, A000788, A014499, A095375.
%K A095377 nonn,base,more
%O A095377 1,2
%A A095377 _Labos Elemer_, Jun 07 2004
%E A095377 a(16)-a(17) from _Donovan Johnson_, May 03 2010
%E A095377 a(18) from _Giovanni Resta_, May 08 2017