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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093337 Penultimate digits of the primes. 0
 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 8, 8, 9, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 11,5 LINKS Table of n, a(n) for n=11..115. MATHEMATICA IntegerDigits[#][[-2]]&/@Prime[Range[5, 110]] (* Harvey P. Dale, Apr 08 2019 *) PROG (PARI) penult(n) = { forprime(x=11, n, s = Str(x); ln = length(s); pu = mid(s, ln-1, 1); print1(pu", ") ) } \ 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) } (Magma) [Intseq(p)[2]: p in PrimesInInterval(11, 600)]; // Bruno Berselli, Feb 14 2013 CROSSREFS Cf. A093336, A077648, A007652. Sequence in context: A088462 A189574 A233795 * A254528 A176044 A120397 Adjacent sequences: A093334 A093335 A093336 * A093338 A093339 A093340 KEYWORD nonn,base AUTHOR Cino Hilliard, Apr 25 2004 STATUS approved

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.

Last modified December 5 21:07 EST 2023. Contains 367594 sequences. (Running on oeis4.)