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 A349429 #25 Nov 18 2021 12:41:39
%S A349429 1,119,129361,353851559,1806970377121,14829833979504599,
%T A349429 178506068100424343281,2962559872323037509279239,
%U A349429 64836735740991992791046187841,1809194806338763806974577192135479,62691937652492245112191045131692230801,2641170468091820745160358034750851940073319
%N A349429 Expansion of e.g.f. cos(5*x)*cos(9*x)/cos(15*x) (even powers only).
%C A349429 Only terms of even indices are given. See Formula (10) in the Lawrence-Zagier article.
%H A349429 Ruth Lawrence and Don Zagier, <a href="https://doi.org/10.4310/AJM.1999.v3.n1.a5">Modular forms and quantum invariants of 3-manifolds</a>, Asian J. Math. 3 (1999), no. 1, 93-107.
%F A349429 E.g.f.: cos(5*x) * cos(9*x) / cos(15*x).
%F A349429 From _Peter Luschny_, Nov 17 2021: (Start)
%F A349429 a(n) = (-900)^n*(E(2*n, 1/30) + E(2*n, 11/30)) / 2, where E(n, x) are the Euler polynomials.
%F A349429 a(n) ~ c*(2*n)!*(30/Pi)^(2*n) where c = 0.64812598778325714671749857159... (End)
%p A349429 A349429 := n -> (-900)^n*(euler(2*n, 1/30) + euler(2*n, 11/30)) / 2:
%p A349429 seq(A349429(n), n = 0..11); # _Peter Luschny_, Nov 17 2021
%t A349429 m = 13; Take[CoefficientList[Series[Cos[5*x]*Cos[9*x]/Cos[15*x], {x, 0, 2*m}], x] * Range[0, 2*m]!, {1, 2*m + 1, 2}] (* _Amiram Eldar_, Nov 17 2021 *)
%o A349429 (Sage)
%o A349429 x = PowerSeriesRing(QQ, 'x', default_prec=30).gen()
%o A349429 f = cos(5*x) * cos(9*x) / cos(15*x)
%o A349429 [cf for cf in f.egf_to_ogf() if cf]
%K A349429 nonn
%O A349429 0,2
%A A349429 _F. Chapoton_, Nov 17 2021