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 A081074 #30 Jul 02 2025 16:02:01
%S A081074 0,18,141,984,6762,46365,317808,2178306,14930349,102334152,701408730,
%T A081074 4807526973,32951280096,225851433714,1548008755917,10610209857720,
%U A081074 72723460248138,498454011879261,3416454622906704,23416728348467682
%N A081074 Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).
%D A081074 Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75.
%H A081074 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (8,-8,1).
%F A081074 a(n) = 8a(n-1) - 8a(n-2) + a(n-3).
%F A081074 G.f.: 3*x^2*(-6+x) / ( (x-1)*(x^2-7*x+1) ). a(n) = A033888(n)-3. - _R. J. Mathar_, Sep 03 2010
%p A081074 with(combinat): for n from 1 to 40 do printf(`%d,`,fibonacci(4*n)-3) od: # _James Sellers_, Mar 05 2003
%t A081074 Fibonacci[4Range[25]]-3 (* or *)
%t A081074 LinearRecurrence[{8,-8,1},{0,18,141},25] (* _Paolo Xausa_, Jan 07 2024 *)
%o A081074 (Magma) [Fibonacci(4*n)-3: n in [1..50]]; // _Vincenzo Librandi_, Apr 20 2011
%Y A081074 Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
%K A081074 nonn,easy
%O A081074 1,2
%A A081074 _R. K. Guy_, Mar 04 2003
%E A081074 More terms from _James Sellers_, Mar 05 2003