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.

A139125 a(0) = 0; a(n) = a(n-1) + binomial( n(n+1)/2, n) mod n.

This page as a plain text file.
%I A139125 #6 Nov 21 2013 12:49:20
%S A139125 0,1,3,5,8,8,12,16,21,21,27,34,41,41,50,58,67,67,77,77,80,80,92,98,
%T A139125 111,124,129,129,144,148,164,180,204,204,224,236,255,255,259,297,318,
%U A139125 318,340,362,392,392,416,428,453,478,496,496,523,523,568,619,670,670,700
%N A139125 a(0) = 0; a(n) = a(n-1) + binomial( n(n+1)/2, n) mod n.
%C A139125 a(n) = a(n-1)+A137345(n).
%p A139125 P:=proc(n) local a,b,i,k; a:=0; k:=0; for i from 1 by 1 to n do a:=a+i; b:=(binomial(a,i) mod i); k:=k+b; print(k); od; end: P(101);
%t A139125 Rest[RecurrenceTable[{a[0]==0,a[n]==a[n-1]+Mod[Binomial[n (n+1)/2,n], n]}, a,{n,60}]] (* _Harvey P. Dale_, Dec 14 2011 *)
%Y A139125 Cf. A137345.
%K A139125 easy,nonn
%O A139125 0,3
%A A139125 _Paolo P. Lava_ and _Giorgio Balzarotti_, Apr 08 2008, Apr 14 2008