The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092614 Let p_i(n) = n-th prime ending in i; then a(n) = (p_1(n) + p_3(n) + p_7(n) + p_9(n))/10. 3
 4, 9, 16, 23, 28, 38, 46, 53, 61, 71, 78, 87, 97, 111, 118, 128, 133, 146, 154, 161, 169, 186, 193, 200, 219, 228, 239, 248, 259, 267, 274, 287, 298, 313, 319, 331, 348, 358, 372, 378, 392, 400, 408, 417, 426, 447, 461, 466, 475, 487, 502, 515, 523, 537, 543 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS MATHEMATICA Table[ A092613[n]/10, {n, 60}] (* Robert G. Wilson v, Apr 13 2004 *) PROG (PARI) {k=56; m=matrix(9, k); v=[1, 0, 1, 0, 0, 0, 1, 0, 1]; c=vector(9); p=2; d=0; while(d<4, p=nextprime (p+1); r=p%10; c[r]++; if(c[r]<=k, m[r, c[r]]=p; if(c[r]==k, d++))); w=v*m/10; for(j=1, k, print1(w[j], ", "))} CROSSREFS First differences are in A093723. A092613/10. Sequence in context: A001639 A309138 A162207 * A313351 A085899 A027874 Adjacent sequences:  A092611 A092612 A092613 * A092615 A092616 A092617 KEYWORD easy,nonn,base AUTHOR Jorge Coveiro, Apr 11 2004 EXTENSIONS More terms and PARI code from Klaus Brockhaus, Apr 12 2004 More terms from Robert G. Wilson v, Apr 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 11:48 EST 2021. Contains 349563 sequences. (Running on oeis4.)