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.

A098662 E.g.f. BesselI(0,2*sqrt(3)*x) + BesselI(1,2*sqrt(3)*x)/sqrt(3).

This page as a plain text file.
%I A098662 #19 May 23 2021 12:34:15
%S A098662 1,1,6,9,54,90,540,945,5670,10206,61236,112266,673596,1250964,7505784,
%T A098662 14073345,84440070,159497910,956987460,1818276174,10909657044,
%U A098662 20827527084,124965162504,239516561466,1437099368796,2763652632300
%N A098662 E.g.f. BesselI(0,2*sqrt(3)*x) + BesselI(1,2*sqrt(3)*x)/sqrt(3).
%C A098662 Fourth binomial transform is A098663.
%H A098662 Robert Israel, <a href="/A098662/b098662.txt">Table of n, a(n) for n = 0..1855</a>
%F A098662 G.f.: 1/sqrt(1-12*x^2) + (1-sqrt(1-12*x^2))/(6*x*sqrt(1-12*x^2));
%F A098662 G.f.: (1 + 6*x - sqrt(1-12*x^2))/(6*x*sqrt(1-12*x^2));
%F A098662 a(n) = binomial(n, floor(n/2))*3^floor(n/2).
%F A098662 Conjecture: (n+1)*a(n) + 6(n-1)*a(n-1) - 12n*a(n-2) + 72*(2-n)*a(n-3) = 0. - _R. J. Mathar_, Dec 08 2011
%F A098662 Conjecture confirmed using the differential equation x*(6x+1)*(12*x^2-1) * g'(x) + (6*x-1)*(12*x^2+6*x+1)*g(x) + 2*x + 1 = 0 satisfied by the g.f. - _Robert Israel_, Aug 23 2019
%p A098662 seq(binomial(n, floor(n/2))*3^floor(n/2),n=0..30); # _Robert Israel_, Aug 23 2019
%t A098662 With[{nn=30},CoefficientList[Series[BesselI[0,2Sqrt[3]x]+ BesselI[1, 2Sqrt[3]x]/ Sqrt[3],{x,0,nn}],x] Range[0,nn]!] (* _Harvey P. Dale_, Oct 01 2013 *)
%K A098662 easy,nonn
%O A098662 0,3
%A A098662 _Paul Barry_, Sep 20 2004