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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091184 a(n) = (least prime beginning with prime(n) and having as many digits) - (least integer beginning with prime(n) and having as many digits). 0
 3, 7, 21, 3, 21, 21, 9, 9, 3, 23, 291, 3, 149, 3, 137, 489, 47, 189, 63, 51, 103, 271, 59, 237, 331, 369, 531, 417, 249, 57, 223, 297, 29, 217, 473, 237, 571, 451, 279, 1457, 869, 213, 317, 609, 239, 57, 417, 583, 879, 493, 221, 989, 7, 819, 1389, 423, 27, 733, 309 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..59. FORMULA a(n)=A090927(n) - prime(n)*10^(prime(n)-d), where d = the number of digits in prime(n). CROSSREFS Cf. A090927. Sequence in context: A110149 A024331 A007174 * A174348 A196035 A196038 Adjacent sequences: A091181 A091182 A091183 * A091185 A091186 A091187 KEYWORD base,easy,nonn AUTHOR Ray Chandler, Dec 29 2003 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 February 29 13:21 EST 2024. Contains 370425 sequences. (Running on oeis4.)