Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093339
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093339 Middle digits of primes with an odd number of digits. +0
3
2, 3, 5, 7, 0, 0, 0, 0, 1, 2, 3, 3, 3, 4, 5, 5, 6, 6, 7, 7, 8, 9, 9, 9, 9, 1, 2, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 0, 1, 1, 1, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 0, 0, 1, 2, 3, 3, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 9, 0, 0, 2, 2, 4, 4, 5, 6, 6, 7, 7, 8, 9, 9, 0, 0, 1, 1, 1, 3, 4, 4, 4, 5, 5, 6, 7, 7, 8, 9, 0 (list; graph; listen)
OFFSET

2,1

PROGRAM

(PARI) midd(n) = { forprime(x=2, n, s = Str(x); ln = length(s); if(ln<2, p=1, p = (ln-1)/2+1); if(ln%2, md = eval(mid(s, p, 1)); print1(md", ") ) ) } \ Get a substring of length n from string str starting at position s in str. mid(str, s, n) = { v =""; tmp = Vec(str); ln=length(tmp); for(x=s, s+n-1, v=concat(v, tmp[x]); ); return(v) }

CROSSREFS

Cf. A077648, A007652.

Sequence in context: A131599 A076384 A124648 this_sequence A113566 A020775 A041000

Adjacent sequences: A093336 A093337 A093338 this_sequence A093340 A093341 A093342

KEYWORD

base,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Apr 25 2004

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research