login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109181 a(n) = A003132(A052034(n)). 4

%I #21 Mar 20 2021 11:03:59

%S 2,13,17,37,73,2,11,11,59,59,131,83,131,163,17,89,11,19,59,19,67,43,

%T 67,139,139,17,97,41,113,53,61,101,37,53,61,101,73,109,131,67,139,107,

%U 179,149,109,137,83,163,139,131,179,163,211,11,83,11,19,83,131,11,83,47,67,103,11,19,59,47,107,43,67,107,179,47,127,167,199,131,67,163

%N a(n) = A003132(A052034(n)).

%C For the primes p see A052034.

%H Zak Seidov, <a href="/A109181/b109181.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A003132(A052034(n)). - _Zak Seidov_, Dec 30 2013

%e q=13 is a term because 13 = 2^2 + 3^2 and merging digits 2 and 3 makes p=23, which is a prime.

%p a:=proc(n) local nn, L: nn:=convert(n,base,10): L:=nops(nn): if isprime(n) = true and isprime(add(nn[j]^2,j=1..L))=true then add(nn[j]^2,j=1..L) else end if end proc: seq(a(n),n=1..1200); # _Emeric Deutsch_, Jan 08 2008

%Y Cf. A003132, A052034.

%K base,nonn

%O 1,1

%A _Zak Seidov_, Jun 21 2005

%E More terms from _Emeric Deutsch_ and _Alvin Hoover Belt_, Jan 08 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 18:01 EDT 2024. Contains 375592 sequences. (Running on oeis4.)