Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095216 Smallest prime divisor of n-th partial concatenation is prime(n). +0
2
2, 1, 5, 11, 27, 81, 153, 91, 71, 183, 27, 67, 147, 219, 347, 99 (list; graph; listen)
OFFSET

1,1

EXAMPLE

Smallest prime divisor of 21511 which is a concatenation of first four terms 2,1,5 and 11 is prime(4) = 7, 21511= 7^2*439.

MAPLE

catL := proc(L) local resul, a ; resul := 0 ; for a in L do resul := resul*10^(max(1, ilog10(a)+1))+a ; od ; RETURN(resul) ; end: A020639 := proc(n) op(1, op(1, ifactors(n)[2])) ; end: A095216 := proc(nmax) local a, anext, n; a := [2] ; while nops(a) < nmax do anext := 0 ; n := nops(a)+1 ; while A020639(catL([op(a), anext])) <> ithprime(n) do anext := anext+1 ; od; a := [op(a), anext] ; od ; RETURN(a) ; end: A095216(15) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 03 2007

CROSSREFS

Sequence in context: A110352 A107310 A049950 this_sequence A063635 A013014 A012905

Adjacent sequences: A095213 A095214 A095215 this_sequence A095217 A095218 A095219

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 10 2004

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 03 2007

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research