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.

A168161 Primes p which are equal to the sum of the binary digits in all primes <= p.

This page as a plain text file.
%I A168161 #14 Feb 04 2015 18:23:19
%S A168161 3,5,11,19,23,47,61
%N A168161 Primes p which are equal to the sum of the binary digits in all primes <= p.
%C A168161 A subsequence of A168162.
%F A168161 A168161 = { prime p | p=A095375(pi(p)) }, where pi(n) = A000720(n).
%t A168161 sbdQ[n_]:=Total[Flatten[IntegerDigits[#,2]&/@Prime[Range[PrimePi[ n]]]]] == n; Select[Prime[Range[20]],sbdQ] (* _Harvey P. Dale_, Feb 04 2015 *)
%o A168161 (PARI) s=0; forprime(p=1, 9999, if(p==s+=norml2(binary(p)), print1(p, ", ")))
%Y A168161 Cf. A217792
%K A168161 fini,full,nonn,base
%O A168161 1,1
%A A168161 _M. F. Hasler_, Nov 22 2009
%E A168161 Cross reference added by _Harvey P. Dale_, Mar 26 2013