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.

A178563 Primes p such that A178344(p) is also prime.

This page as a plain text file.
%I A178563 #9 Feb 19 2019 23:34:52
%S A178563 3,11,37,47,59,131,149,151,157,163,181,191,193,197,229,233,239,251,
%T A178563 523,541,547,557,569,599,601,613,617,631,643,653,661,677,701,727,751,
%U A178563 761,769,787,809,823,839,883,937,941,947,953,967,971,1021
%N A178563 Primes p such that A178344(p) is also prime.
%H A178563 Michael De Vlieger, <a href="/A178563/b178563.txt">Table of n, a(n) for n = 1..10000</a>
%e A178563 a(22)=601 because 29^1 + 23^0 + 19^0 + 17^1 + 13^0 + 11^1 + 7^1 + 5^0 + 3^0 + 2^1 = 71 is prime and 601 = 1001011001_2.
%p A178563 A178344 := proc(n) local bdgs; bdgs := convert(n,base,2) ; add( ithprime(i)^op(i,bdgs), i=1..nops(bdgs)) ; end proc:
%p A178563 for n from 1 to 2000 do if isprime(n) and isprime(A178344(n)) then printf("%d,",n) ; end if; end do: # _R. J. Mathar_, Jun 07 2010
%t A178563 Select[Prime@ Range@ 200, PrimeQ@ Total@ MapIndexed[Prime[First@ #2]^#1 &, Reverse@ IntegerDigits[#, 2]] &] (* _Michael De Vlieger_, Feb 19 2019 *)
%K A178563 nonn
%O A178563 1,1
%A A178563 _Juri-Stepan Gerasimov_, May 29 2010
%E A178563 229, 233, 541 inserted by _R. J. Mathar_, Jun 07 2010