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 A081007 #61 Jul 02 2025 16:02:01
%S A081007 0,4,33,232,1596,10945,75024,514228,3524577,24157816,165580140,
%T A081007 1134903169,7778742048,53316291172,365435296161,2504730781960,
%U A081007 17167680177564,117669030460993,806515533049392,5527939700884756,37889062373143905,259695496911122584
%N A081007 a(n) = Fibonacci(4n+1) - 1, or Fibonacci(2n)*Lucas(2n+1).
%C A081007 Also the index of the first of two consecutive triangular numbers whose sum is equal to the sum of two consecutive heptagonal numbers. - _Colin Barker_, Dec 20 2014
%D A081007 Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75
%H A081007 Nathaniel Johnston, <a href="/A081007/b081007.txt">Table of n, a(n) for n = 0..500</a>
%H A081007 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (8,-8,1).
%F A081007 a(n) = 8*a(n-1) - 8*a(n-2) + a(n-3).
%F A081007 G.f.: x*(4+x)/((1-x)*(1-7*x+x^2)). - _Colin Barker_, Jun 24 2012
%F A081007 a(n) = Sum_{i=1..2n} binomial(2n+i, 2n-i). - _Wesley Ivan Hurt_, Oct 06 2013
%F A081007 a(n) = Sum_{i=0..2n-1} F(i)*L(i+2), F(i) = A000045(i) and L(i) = A000032(i). - _Rigoberto Florez_, Apr 19 2019
%F A081007 Product_{n>=1} (1 - 1/a(n)) = (1 + 1/sqrt(5))/2 (A242671). - _Amiram Eldar_, Nov 28 2024
%p A081007 with(combinat) for n from 0 to 30 do printf(`%d,`,fibonacci(4*n+1)-1) od # _James Sellers_, Mar 03 2003
%t A081007 Table[Fibonacci[4n+1] -1, {n,0,30}] (* _Wesley Ivan Hurt_, Oct 06 2013 *)
%t A081007 LinearRecurrence[{8,-8,1},{0,4,33},30] (* _Harvey P. Dale_, Jul 31 2018 *)
%t A081007 Table[Fibonacci[2n]LucasL[2n+1], {n,0,30}] (* _Rigoberto Florez_, Apr 19 2019 *)
%o A081007 (Magma) [Fibonacci(4*n+1) -1: n in [0..30]]; // _Vincenzo Librandi_, Apr 15 2011
%o A081007 (Maxima) A081007(n):=fib(4*n+1)-1$
%o A081007 makelist(A081007(n),n,0,30); /* _Martin Ettl_, Nov 12 2012 */
%o A081007 (PARI) concat(0, Vec(x*(4+x)/((1-x)*(1-7*x+x^2)) + O(x^30))) \\ _Colin Barker_, Dec 20 2014
%o A081007 (PARI) vector(30, n, n--; fibonacci(4*n+1)-1) \\ _G. C. Greubel_, Jul 14 2019
%o A081007 (Sage) [fibonacci(4*n+1)-1 for n in (0..30)] # _G. C. Greubel_, Jul 14 2019
%o A081007 (GAP) List([0..30], n-> Fibonacci(4*n+1)-1); # _G. C. Greubel_, Jul 14 2019
%Y A081007 Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
%Y A081007 Cf. A081018, A242671.
%K A081007 nonn,easy
%O A081007 0,2
%A A081007 _R. K. Guy_, Mar 01 2003
%E A081007 More terms from _James Sellers_, Mar 03 2003