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.

A095233 a(n) = a(n-1) + Sum(floor(n/p): p prime), a(1) = 1.

This page as a plain text file.
%I A095233 #7 May 21 2017 07:31:46
%S A095233 1,2,4,7,11,17,24,32,41,52,64,78,93,110,129,149,170,193,217,243,271,
%T A095233 301,332,365,399,435,472,511,551,594,638,683,730,779,830,883,937,993,
%U A095233 1051,1111,1172,1236,1301,1368,1437,1508,1580,1654,1729,1806,1885
%N A095233 a(n) = a(n-1) + Sum(floor(n/p): p prime), a(1) = 1.
%C A095233 a(n+1) - a(n) = A013939(n+1).
%H A095233 G. C. Greubel, <a href="/A095233/b095233.txt">Table of n, a(n) for n = 1..1000</a>
%t A095233 A013939[n_] := Sum[Floor[n/Prime[k]], {k, 1, n}]; RecurrenceTable[{a[n] == a[n - 1] + A013939[n], a[1] == 1}, a, {n, 1, 50}] (* _G. C. Greubel_, May 20 2017 *)
%Y A095233 Cf. A001221.
%K A095233 nonn
%O A095233 1,2
%A A095233 _Reinhard Zumkeller_, Jun 22 2004