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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Dec 16 2024 22:18:03
%S 1,4,8,14,22,34,48,66,86,110,140,172,210,252,296,344,398,458,520,588,
%T 660,734,814,898,988,1086,1188,1292,1400,1510,1624,1752,1884,2022,
%U 2162,2312,2464,2622,2786,2954,3128,3308,3490,3682,3876,4074,4274,4486,4710
%N a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.
%C The number of integers between a(n) and a(n+1) exclusive equals the n-th prime.
%F a(n) = A060939(n-1) + 1. - _Alan Michael Gómez Calderón_, Dec 16 2024
%t RecurrenceTable[{a[n]==a[n-1]+Prime[n]+1,a[0]==1},a,{n,50}] (* _Harvey P. Dale_, Apr 22 2011 *)
%Y Cf. A060939.
%K nonn
%O 1,2
%A _G. L. Honaker, Jr._, Sep 20 2005
%E More terms from Harvey P. Dale, Apr 22 2011.