Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111479 a(n) = least positive number such that (2 Concat Concat_{k=0}^n Repeat(A045572(n), a(n))) is a prime. A045572 = odd numbers not divisible by 5. +0
2
2, 1, 7, 8, 18 (list; graph; listen)
OFFSET

0,1

COMMENT

Concat is the operator that concatenates two numbers as decimal strings, and Repeat returns the number obtained by concatenating the first argument to itself the second argument number of times.

EXAMPLE

21 is not a prime, but 211 is, so a(0)=2.

211,2113,21137777777 are all primes.

21137777777 is a prime obtained as 2 followed by two 1's, one 3, and seven 7's, so a(2) = 7.

CROSSREFS

Cf. A111471, A111472, A111473, A111474, A111475, A111477, A111478, A111480.

Sequence in context: A011134 A144749 A021463 this_sequence A141513 A102817 A026252

Adjacent sequences: A111476 A111477 A111478 this_sequence A111480 A111481 A111482

KEYWORD

base,more,nonn,less

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 05 2005

EXTENSIONS

Edited by Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 29 2006.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research