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.

A032767 a(n) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).

This page as a plain text file.
%I A032767 #15 Oct 18 2024 15:07:32
%S A032767 0,2,8,20,38,64,100,148,208,282,373,480,606,753,921,1112,1328,1571,
%T A032767 1841,2140,2471,2833,3229,3661,4129,4635,5182,5769,6399,7074,7794,
%U A032767 8561,9377,10244,11162,12133,13160,14242,15382,16582,17842,19164
%N A032767 a(n) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).
%H A032767 Harvey P. Dale, <a href="/A032767/b032767.txt">Table of n, a(n) for n = 0..1000</a>
%F A032767 The g.f. has denominator (1-x)^4(1-x^16). - _Ralf Stephan_, May 16 2005
%p A032767 A032767 := proc(n)
%p A032767         n*(n+1)*(n+2)*(n+3) /(4*n+6) ;
%p A032767         floor(%) ;
%p A032767 end proc: # _R. J. Mathar_, May 20 2013
%t A032767 Table[Floor[Times@@(n+Range[0,3])/Total[n+Range[0,3]]],{n,0,50}] (* _Harvey P. Dale_, Oct 18 2024 *)
%Y A032767 Cf. A032765-A032798.
%K A032767 nonn
%O A032767 0,2
%A A032767 _Patrick De Geest_, May 15 1998