login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155081 Primes n such that largest digit of cjncatenation of n and n-th prime is a prime. 0
2, 3, 5, 7, 11, 31, 37, 47, 53, 67, 71, 73, 101, 113, 137, 173, 227, 233, 241, 257, 271, 307, 331, 347, 367, 521, 523, 557, 571, 577, 607, 613, 673, 727, 733, 743, 751, 1277, 1307, 1361, 1367, 1451, 1453, 1471, 1511, 1523, 1553, 1567, 1571, 1627, 1657, 1663 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..52.

EXAMPLE

If n=2=prime and 3=prime(2), then concatenation=23(2<3=prime) and 2=a(1). If n=3=prime and 5=prime(3), then c0ncatenation=35(3<5=prime) and 3=a(2). If n=7=prime and 17=prime(7), then concatenation=717(1<7=7=prime) and 7=a(3), etc.

MAPLE

concat := proc (a, b) local bb: bb := nops(convert(b, base, 10)): 10^bb*a+b end proc: p := proc (n) local dig, ld: dig := convert(concat(n, ithprime(n)), base, 10): ld := max(seq(dig[j], j = 1 .. nops(dig))): if isprime(n) = true and isprime(ld) = true then n else end if end proc: seq(p(n), n = 1 .. 2000); [From Emeric Deutsch, Jan 27 2009]

CROSSREFS

Cf. A000040.

Sequence in context: A028911 A028912 A075236 * A157158 A155833 A028867

Adjacent sequences:  A155078 A155079 A155080 * A155082 A155083 A155084

KEYWORD

nonn,base

AUTHOR

Juri-Stepan Gerasimov, Jan 19 2009

EXTENSIONS

Corrected (added 5, removed 19, 59) and extended by Emeric Deutsch, Jan 27 2009

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 22 03:32 EST 2014. Contains 249800 sequences.