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.
%I A254286 #23 Mar 12 2024 02:42:04
%S A254286 1,96,14336,2523136,484442112,98180268032,20645907791872,
%T A254286 4459516083044352,983075545417777152,220208922173582082048,
%U A254286 49967406340478261526528,11459191854083014643417088,2651480699775516003646046208,618173786004806016850049630208
%N A254286 Expansion of (1 - (1-256*x)^(1/4)) / (64*x).
%H A254286 G. C. Greubel, <a href="/A254286/b254286.txt">Table of n, a(n) for n = 0..250</a>
%F A254286 G.f.: (1 - (1-256*x)^(1/4)) / (64*x).
%F A254286 a(n) ~ 256^n / (Gamma(3/4) * n^(5/4)).
%F A254286 Recurrence: (n+1)*a(n) = 64*(4*n-1)*a(n-1).
%F A254286 a(n) = 256^n * Gamma(n+3/4) / (Gamma(3/4) * Gamma(n+2)).
%F A254286 E.g.f.: hypergeom([3/4], [2], 256*x). - _Vaclav Kotesovec_, Jan 28 2015
%F A254286 From _Peter Bala_, Sep 01 2017: (Start)
%F A254286 a(n) = (-1)^n*binomial(1/4, n+1)*4^(4*n+1). Cf. A000108(n) = (-1)^n*binomial(1/2, n+1)*2^(2*n+1).
%F A254286 a(n) = 16^n*A025749(n+1); a(n) = 32^n*A048779(n+1).
%F A254286 (End)
%t A254286 CoefficientList[Series[(1-(1-256*x)^(1/4)) / (64*x),{x,0,20}],x]
%t A254286 CoefficientList[Series[Hypergeometric1F1[3/4,2,256*x],{x,0,20}],x] * Range[0,20]! (* _Vaclav Kotesovec_, Jan 28 2015 *)
%o A254286 (Magma) [Round(2^(8*n)*Gamma(n+3/4)/(Gamma(3/4)*Gamma(n+2))): n in [0..30]]; // _G. C. Greubel_, Aug 10 2022
%o A254286 (SageMath) [2^(8*n)*rising_factorial(3/4,n)/factorial(n+1) for n in (0..30)] # _G. C. Greubel_, Aug 10 2022
%Y A254286 Cf. A000108, A008545, A025749, A048779, A254282, A254287.
%K A254286 nonn,easy
%O A254286 0,2
%A A254286 _Vaclav Kotesovec_, Jan 27 2015