cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A110895 a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.

This page as a plain text file.
%I A110895 #18 Aug 29 2025 20:34:34
%S A110895 1,4,8,14,22,34,48,66,86,110,140,172,210,252,296,344,398,458,520,588,
%T A110895 660,734,814,898,988,1086,1188,1292,1400,1510,1624,1752,1884,2022,
%U A110895 2162,2312,2464,2622,2786,2954,3128,3308,3490,3682,3876,4074,4274,4486,4710
%N A110895 a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.
%C A110895 The number of integers between a(n) and a(n+1) exclusive equals the n-th prime.
%F A110895 a(n) = A060939(n-1) + 1. - _Alan Michael Gómez Calderón_, Dec 16 2024
%t A110895 RecurrenceTable[{a[n]==a[n-1]+Prime[n]+1,a[0]==1},a,{n,50}]  (* _Harvey P. Dale_, Apr 22 2011 *)
%Y A110895 Cf. A060939.
%K A110895 nonn,changed
%O A110895 1,2
%A A110895 _G. L. Honaker, Jr._, Sep 20 2005
%E A110895 More terms from _Harvey P. Dale_, Apr 22 2011