cp's OEIS Frontend

A179435 For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define a_n = Sum_{j=1..m} (p_j*k_j) and b_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which a_n and b_n are both prime and unequal.

%I A179435 #24 Nov 20 2020 06:09:55
%S A179435 40,48,54,88,108,184,250,384,424,432,448,808,864,1048,1216,1384,1528,
%T A179435 1575,1680,1792,1864,1890,2104,2184,2457,2925,2944,3080,3120,3328,
%U A179435 3510,3696,3712,3915,4125,4158,4288,4504,4744,4950,5224,5488,5632,5928,5940,6240
%N A179435 For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define a_n = Sum_{j=1..m} (p_j*k_j) and b_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which a_n and b_n are both prime and unequal.
%C A179435 Is the sequence infinite?
%C A179435 Odd terms in the sequence are: a(18) = 1575, a(25) = 2457, a(26) = 2925, a(34) = 3915, a(35) = 4125, a(47) = 6345, a(50) = 6669, ...
%H A179435 Alois P. Heinz, <a href="/A179435/b179435.txt">Table of n, a(n) for n = 1..1000</a>
%e A179435 a(1) = 40 = 2^3*5^1, with a = 11 and b = 13.
%e A179435 a(2) = 48 = 2^4*3^1, with a = 11 and b = 19.
%e A179435 Notice that a and b are both prime and not equal.
%p A179435 a:= proc(n) option remember; local an, bn, k, l;
%p A179435       for k from 1 +`if`(n=1, 0, a(n-1)) do
%p A179435         l:= ifactors(k)[2];
%p A179435         an:= add( i[1] * i[2], i=l);
%p A179435         bn:= add( i[1] ^ i[2], i=l);
%p A179435         if isprime(an) and isprime(bn) and an<>bn then break fi
%p A179435       od; k
%p A179435     end:
%p A179435 seq(a(n), n=1..50);  # _Alois P. Heinz_, Jan 20 2011
%t A179435 a[n_] := a[n] = Module[{an, bn, k, p, e}, For[k = 1 + If[n==1, 0, a[n-1]], True, k++, {p, e} = Transpose[FactorInteger[k]]; an = p.e; bn = Total[p^e]; If[PrimeQ[an] && PrimeQ[bn] && an != bn, Break[]]]; k];
%t A179435 Array[a, 50] (* _Jean-François Alcover_, Nov 20 2020 *)
%K A179435 nonn
%O A179435 1,1
%A A179435 _Bobby Browning_ and Rohan Hemasinha (rhemasin(AT)uwf.edu), Jan 07 2011
%E A179435 More terms from _Alois P. Heinz_, Jan 20 2011