The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092613 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). 4

%I

%S 40,90,160,230,280,380,460,530,610,710,780,870,970,1110,1180,1280,

%T 1330,1460,1540,1610,1690,1860,1930,2000,2190,2280,2390,2480,2590,

%U 2670,2740,2870,2980,3130,3190,3310,3480,3580,3720,3780,3920,4000,4080,4170,4260

%N 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).

%C All terms end in 0, first term to end in just 00 is a(67), with 000 a(24) and with 0000 is a(1168). - _Robert G. Wilson v_, Apr 13 2004

%e a(1) = 3+7+11+19 = 40.

%e a(2) = 13+17+31+29 = 90.

%e a(3) = 23+37+41+59 = 160.

%t A092613[n_] := Block[{p = Prime[ Range[5*(n + 10)]]}, Select[p, Mod[ #, 10] == 1 &][[n]] + Select[p, Mod[ #, 10] == 3 &][[n]] + Select[p, Mod[ #, 10] == 7 &][[n]] + Select[p, Mod[ #, 10] == 9 &][[n]]]; Table[ A092613[n], {n, 50}] (* _Robert G. Wilson v_, Apr 13 2004 *)

%K base,nonn

%O 1,1

%A _Jorge Coveiro_, Apr 11 2004

%E More terms from _Robert G. Wilson v_, Apr 13 2004

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 November 29 18:41 EST 2021. Contains 349416 sequences. (Running on oeis4.)