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.

A162466 a(n) = 12*a(n-2) for n > 2; a(1) = 1, a(2) = 8.

This page as a plain text file.
%I A162466 #8 Sep 17 2020 13:54:51
%S A162466 1,8,12,96,144,1152,1728,13824,20736,165888,248832,1990656,2985984,
%T A162466 23887872,35831808,286654464,429981696,3439853568,5159780352,
%U A162466 41278242816,61917364224,495338913792,743008370688,5944066965504
%N A162466 a(n) = 12*a(n-2) for n > 2; a(1) = 1, a(2) = 8.
%C A162466 Eighth binomial transform is A161729.
%H A162466 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,12).
%F A162466 a(n) = (5-(-1)^n)*2^(1/2 *(2*n-3+(-1)^n))*3^(1/4*(2*n-5+(-1)^n)).
%F A162466 G.f.: x*(1+8*x)/(1-12*x^2).
%F A162466 a(n) = 2^(n-1)*A074324(n). - _M. F. Hasler_, Dec 03 2014
%t A162466 LinearRecurrence[{0,12},{1,8},30] (* _Harvey P. Dale_, Sep 17 2020 *)
%o A162466 (PARI) {m=24; v=concat([1, 8], vector(m-2)); for(n=3, m, v[n]=12*v[n-2]); v}
%o A162466 (PARI) Vec(x*(1+8*x)/(1-12*x^2)+O(x^29)) \\ _M. F. Hasler_, Dec 03 2014
%Y A162466 Cf. A161729, A161728, A162436, A162272, A074324.
%K A162466 nonn
%O A162466 1,2
%A A162466 _Klaus Brockhaus_, Jul 04 2009
%E A162466 G.f. and comment corrected, formula added by _Klaus Brockhaus_, Sep 18 2009