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.

A020068 a(n) = floor( Gamma(n+2/9) / Gamma(2/9) ).

This page as a plain text file.
%I A020068 #24 Sep 08 2022 08:44:44
%S A020068 1,0,0,0,1,8,42,266,1927,15844,146122,1493700,16762639,204876708,
%T A020068 2708925368,38526938568,586465620430,9513775620309,163848357905335,
%U A020068 2985681188497227,57391427290002261,1160582196308934615
%N A020068 a(n) = floor( Gamma(n+2/9) / Gamma(2/9) ).
%H A020068 G. C. Greubel, <a href="/A020068/b020068.txt">Table of n, a(n) for n = 0..445</a>
%p A020068 Digits := 64:f := proc(n,x) trunc(GAMMA(n+x)/GAMMA(x)); end;
%p A020068 seq(floor(pochhammer(2/9,n)), n = 0..25); # _G. C. Greubel_, Nov 13 2019
%t A020068 Floor[Pochhammer[2/9, Range[0, 25]]] (* _G. C. Greubel_, Nov 13 2019 *)
%o A020068 (PARI) x=2/9; vector(26, n, gamma(n-1+x)\gamma(x) ) \\ _G. C. Greubel_, Nov 13 2019
%o A020068 (Magma) [Floor(Gamma(n+2/9)/Gamma(2/9)): n in [0..25]]; // _G. C. Greubel_, Nov 13 2019
%o A020068 (Sage) [floor(rising_factorial(2/9, n)) for n in (0..25)] # _G. C. Greubel_, Nov 13 2019
%Y A020068 Cf. A020064, A020065, A020066, A020067, A020069.
%Y A020068 Cf. A020023, A020113.
%K A020068 nonn
%O A020068 0,6
%A A020068 _Simon Plouffe_