|
|
A134492
|
|
a(n) = Fibonacci(6*n).
|
|
14
|
|
|
0, 8, 144, 2584, 46368, 832040, 14930352, 267914296, 4807526976, 86267571272, 1548008755920, 27777890035288, 498454011879264, 8944394323791464, 160500643816367088, 2880067194370816120, 51680708854858323072, 927372692193078999176, 16641027750620563662096
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Conjecture: For n >= 2, the terms of this sequence are exactly those Fibonacci numbers which are the sum of the three numbers of a Pythagorean triple (checked up to F(80)). - Felix Huber, Nov 03 2023
|
|
LINKS
|
|
|
FORMULA
|
a(n) = ((-1+(9+4*sqrt(5))^(2*n)))/(sqrt(5)*(9+4*sqrt(5))^n). - Colin Barker, Jan 24 2016
|
|
MATHEMATICA
|
Table[Fibonacci[6n], {n, 0, 30}]
LinearRecurrence[{18, -1}, {0, 8}, 30] (* Harvey P. Dale, Aug 15 2017 *)
|
|
PROG
|
(MuPAD) numlib::fibonacci(6*n) $ n = 0..25; // Zerinvary Lajos, May 09 2008
(Sage) [fibonacci(6*n) for n in range(0, 17)] # Zerinvary Lajos, May 15 2009]
(PARI) concat(0, Vec(8*x/(1-18*x+x^2) + O(x^20))) \\ Colin Barker, Jan 24 2016
|
|
CROSSREFS
|
Cf. A000032, A000045, A008588, A049660, A079343, A014445, A014448, A134493, A134494, A134495, A103134, A134497, A134498.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|