A003268 -id:A003268 - cp's OEIS frontend

A010048 Triangle of Fibonomial coefficients, read by rows.

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 6, 3, 1, 1, 5, 15, 15, 5, 1, 1, 8, 40, 60, 40, 8, 1, 1, 13, 104, 260, 260, 104, 13, 1, 1, 21, 273, 1092, 1820, 1092, 273, 21, 1, 1, 34, 714, 4641, 12376, 12376, 4641, 714, 34, 1, 1, 55, 1870, 19635, 85085, 136136, 85085, 19635, 1870, 55, 1

Offset: 0

N. J. A. Sloane

Conjecture: polynomials with (positive) Fibonomial coefficients are reducible iff n odd > 1. - Ralf Stephan, Oct 29 2004

			First few rows of the triangle T(n, k) are:
  n\k 0   1    2     3     4      5      6      7     8   9  10
   0: 1
   1: 1   1
   2: 1   1    1
   3: 1   2    2     1
   4: 1   3    6     3     1
   5: 1   5   15    15     5      1
   6: 1   8   40    60    40      8      1
   7: 1  13  104   260   260    104     13      1
   8: 1  21  273  1092  1820   1092    273     21     1
   9: 1  34  714  4641 12376  12376   4641    714    34   1
  10: 1  55 1870 19635 85085 136136  85085  19635  1870  55   1
... - Table extended and reformatted by _Wolfdieter Lang_, Oct 10 2012
For n=7 and k=3, n - k + 1 = 7 - 3 + 1 = 5, so T(7,3) = F(7)*F(6)*F(5)/( F(3)*F(2)*F(1)) = 13*8*5/(2*1*1) = 520/2 = 260. - _Michael B. Porter_, Sep 26 2016

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 1, p. 84 and 492.

T. D. Noe, Rows n = 0..50 of triangle, flattened
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
A. T. Benjamin and S. S. Plott, A combinatorial approach to fibonomial coefficients, Fib. Quart. 46/47 (1) (2008/9) 7-9.
A. Brousseau, Fibonacci and Related Number Theoretic Tables, Fibonacci Association, San Jose, CA, 1972.
Johann Cigler, Pascal triangle, Hoggatt matrices, and analogous constructions, arXiv:2103.01652 [math.CO], 2021.
M. Dziemianczuk, Cobweb Sequences Map, See sequence (4).2. [Dead link]
Tom Edgar and Michael Z. Spivey, Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6.
P. F. F. Espinosa, J. F. González, J. P. Herrán, A. M. Cañadas, and J. L. Ramírez, On some relationships between snake graphs and Brauer configuration algebras, Algebra Disc. Math. (2022) Vol. 33, No. 2, 29-59.
Sergio Falcon, On The Generating Functions of the Powers of the K-Fibonacci Numbers, Scholars Journal of Engineering and Technology (SJET), 2014; 2 (4C):669-675.
Dale Gerdemann, Golden Ratio Base Digit Patterns for Columns of the Fibonomial Triangle, "Another interesting pattern is for Golden Rectangle Numbers A001654. I made a short video illustrating this pattern, along with other columns of the Fibonomial Triangle A010048".
Dale K. Hathaway and Stephen L. Brown, Fibonacci Powers and a Fascinating Triangle, The College Mathematics Journal, 28 (No. 2, 1997), 124-128. See Fig. 1.
Ron Knott, The Fibonomials.
E. Krot, An introduction to finite Fibonomial calculus, arXiv:math/0503210 [math.CO], 2005.
E. Krot, Further developments in Fibonomial calculus, arXiv:math/0410550 [math.CO], 2004.
D. Marques and P. Trojovsky, On Divisibility of Fibonomial Coefficients by 3, J. Int. Seq. 15 (2012) #12.6.4.
D. Marques and P. Trojovsky, The p-adic order of some fibonomial coefficients, J. Int. Seq. 18 (2015) # 15.3.1.
Romeo Mestrovic, Lucas' theorem: its generalizations, extensions and applications (1878--2014), arXiv preprint arXiv:1409.3820 [math.NT], 2014.
Phakhinkon Phunphayap, Various Problems Concerning Factorials, Binomial Coefficients, Fibonomial Coefficients, and Palindromes, Ph. D. Thesis, Silpakorn University (Thailand 2021).
Phakhinkon Phunphayap and Prapanpong Pongsriiam, Explicit Formulas for the p-adic Valuations of Fibonomial Coefficients, J. Int. Seq. 21 (2018), #18.3.1.
C. Pita, On s-Fibonomials, J. Int. Seq. 14 (2011) # 11.3.7.
C. J. Pita Ruiz Velasco, Sums of Products of s-Fibonacci Polynomial Sequences, J. Int. Seq. 14 (2011) # 11.7.6.
T. M. Richardson, The Filbert Matrix, arXiv:math/9905079 [math.RA], 1992.
Bruce Sagan, Two Binomial Coefficient Analogues, Slides, 2013.
Jeremiah Southwick, A Conjecture concerning the Fibonomial Triangle, arXiv:1604.04775 [math.NT], 2016.
Ralf Stephan, A recurrence for the fibonomials.
Eric Weisstein's World of Mathematics, Fibonacci Coefficient, q-Binomial Coefficient.

Cf. A055870 (signed version of triangle).
Columns include: A000045, A001654, A001655, A001656, A001657, A001658, A056565, A056566, A056567.
Sums include: A056569 (row), A181926 (antidiagonal), A181927 (row square-sums).
Cf. A003267 and A003268 (central Fibonomial coefficients), A003150 (Fibonomial Catalan numbers), A144712, A099927, A385732/A385733 (Lucas).

Fibonomial:= func< n,k | k eq 0 select 1 else (&*[Fibonacci(n-j+1)/Fibonacci(j): j in [1..k]]) >;
[Fibonomial(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Jul 20 2024

A010048 := proc(n,k)
    mul(combinat[fibonacci](i),i=n-k+1..n)/mul(combinat[fibonacci](i),i=1..k) ;
end proc:
seq(seq(A010048(n,k),k=0..n),n=0..10) ; # R. J. Mathar, Feb 05 2015

f[n_, k_] := Product[ Fibonacci[n - j + 1]/Fibonacci[j], {j, k}]; Table[ f[n, i], {n, 0, 10}, {i, 0, n}] (* Robert G. Wilson v, Dec 04 2009 *)
Column[Round@Table[GoldenRatio^(k(n-k)) QBinomial[n, k, -1/GoldenRatio^2], {n, 0, 10}, {k, 0, n}], Center] (* Round is equivalent to FullSimplify here, but is much faster - Vladimir Reshetnikov, Sep 25 2016 *)
T[n_, k_] := With[{c = ArcCsch[2] - I Pi/2}, Product[I^j Sinh[c j], {j, k + 1, n}] / Product[I^j Sinh[c j], {j, 1, n - k}]]; Table[Simplify[T[n, k]], {n, 0, 10}, {k, 0, n}] // Flatten  (* Peter Luschny, Jul 08 2025 *)

ffib(n):=prod(fib(k),k,1,n);
fibonomial(n,k):=ffib(n)/(ffib(k)*ffib(n-k));
create_list(fibonomial(n,k),n,0,20,k,0,n); /* Emanuele Munarini, Apr 02 2012 */

T(n, k) = prod(j=0, k-1, fibonacci(n-j))/prod(j=1, k, fibonacci(j));
tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n, k), ", ")); print); \\ Michel Marcus, Jul 20 2018

def fibonomial(n,k): return 1 if k==0 else product(fibonacci(n-j+1)/fibonacci(j) for j in range(1,k+1))
flatten([[fibonomial(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 20 2024

T(n, k) = ((n, k)) = (F(n)*F(n-1)*...*F(n-k+1))/(F(k)*F(k-1)*...*F(1)), F(i) = Fibonacci numbers A000045.
T(n, k) = Fibonacci(n-k-1)*T(n-1, k-1) + Fibonacci(k+1)*T(n-1, k).
T(n, k) = phi^(k*(n-k)) * C(n, k)A001622%20is%20the%20golden%20ratio,%20and%20C(n,%20k)_q%20is%20the%20q-binomial%20coefficient.%20-%20_Vladimir%20Reshetnikov">{-1/phi^2}, where phi = (1+sqrt(5))/2 = A001622 is the golden ratio, and C(n, k)_q is the q-binomial coefficient. - _Vladimir Reshetnikov, Sep 26 2016
G.f. of column k: x^k * exp( Sum_{j>=1} Fibonacci((k+1)*j)/Fibonacci(j) * x^j/j ). - Seiichi Manyama, May 07 2025
T(n, k) = Product_{j=k+1..n} i^j*sinh(c*j) / Product_{j=1..n-k} i^j*sinh(c*j) where c = arccsch(2) - i*Pi/2 and i is the imaginary unit. If you substitute sinh by cosh you get the Lucas triangle A385732/A385733, which is a rational triangle. - Peter Luschny, Jul 08 2025

A062073 Decimal expansion of Fibonacci factorial constant.

Original entry on oeis.org

1, 2, 2, 6, 7, 4, 2, 0, 1, 0, 7, 2, 0, 3, 5, 3, 2, 4, 4, 4, 1, 7, 6, 3, 0, 2, 3, 0, 4, 5, 5, 3, 6, 1, 6, 5, 5, 8, 7, 1, 4, 0, 9, 6, 9, 0, 4, 4, 0, 2, 5, 0, 4, 1, 9, 6, 4, 3, 2, 9, 7, 3, 0, 1, 2, 1, 4, 0, 2, 2, 1, 3, 8, 3, 1, 5, 3, 1, 2, 1, 6, 8, 4, 5, 2, 6, 2, 1, 5, 6, 2, 4, 9, 4, 7, 9, 7, 7, 4, 1, 2, 5, 9, 1, 3

Offset: 1

Jason Earls, Jun 27 2001

The Fibonacci factorial constant is associated with the Fibonacci factorial A003266.

Two closely related constants are A194159 and A194160. [Johannes W. Meijer, Aug 21 2011]

			1.226742010720353244417630230455361655871409690440250419643297301214...

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.2.5.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison Wesley, 1990, pp. 478, 571.

Harry J. Smith, Table of n, a(n) for n=1..5000
M. Griffiths, Symmetric rational expressions in the Fibonacci numbers, Fib. Q., 46/47 (2008/2009), 262-267. [_N. J. A. Sloane_, Dec 05 2009]
Simon Plouffe, Fibonacci factorials
Eric Weisstein's World of Mathematics, Fibonacci Factorial Constant

Cf. A003266, A003267, A003268, A056569, A062072, A062381, A135407, A181926.

Cf. A218490, A253924, A256831, A259314, A259405.

RealDigits[N[QPochhammer[-1/GoldenRatio^2], 105]][[1]] (* Alonso del Arte, Dec 20 2010 *)
RealDigits[N[Re[(-1)^(1/24) * GoldenRatio^(1/12) / 2^(1/3) * EllipticThetaPrime[1,0,-I/GoldenRatio]^(1/3)], 120]][[1]] (* Vaclav Kotesovec, Jul 19 2015, after Eric W. Weisstein *)

\p 1300 a=-1/(1/2+sqrt(5)/2)^2; prod(n=1,17000,(1-a^n))

{ default(realprecision, 5080); p=-1/(1/2 + sqrt(5)/2)^2; x=prodinf(k=1, 1-p^k); for (n=1, 5000, d=floor(x); x=(x-d)*10; write("b062073.txt", n, " ", d)) } \\ Harry J. Smith, Jul 31 2009

C = (1-a)*(1-a^2)*(1-a^3)... 1.2267420... where a = -1/phi^2 and where phi is the Golden ratio = 1/2 + sqrt(5)/2.
C = QPochhammer[ -1/GoldenRatio^2]. [Eric W. Weisstein, Dec 01 2009]
C = A194159 * A194160. [Johannes W. Meijer, Aug 21 2011]
C = exp( Sum_{k>=1} 1/(k*(1-(-(3+sqrt(5))/2)^k)) ). - Vaclav Kotesovec, Jun 08 2013
C = Sum_{k = -inf .. inf} (-1)^((k-1)*k/2) / phi^((3*k-1)*k), where phi = (1 + sqrt(5))/2. - Vladimir Reshetnikov, Sep 20 2016

A055870 Signed Fibonomial triangle.

Original entry on oeis.org

1, 1, -1, 1, -1, -1, 1, -2, -2, 1, 1, -3, -6, 3, 1, 1, -5, -15, 15, 5, -1, 1, -8, -40, 60, 40, -8, -1, 1, -13, -104, 260, 260, -104, -13, 1, 1, -21, -273, 1092, 1820, -1092, -273, 21, 1, 1, -34, -714, 4641, 12376, -12376, -4641, 714, 34, -1, 1, -55, -1870, 19635, 85085, -136136, -85085, 19635, 1870, -55, -1

Offset: 0

Wolfdieter Lang, Jul 10 2000

Row n+1 (n >= 1) of the signed triangle lists the coefficients of the recursion relation for the n-th power of Fibonacci numbers A000045: Sum_{m=0..n+1} T(n+1,m)*(Fibonacci(k-m))^n = 0, k >= n+1; inputs: (Fibonacci(k))^n, k=0..n.
The inverse of the row polynomial p(n,x) := Sum_{m=0..n} T(n,m)*x^m is the g.f. for the column m=n-1 of the Fibonomial triangle A010048.
The row polynomials p(n,x) factorize according to p(n,x) = G(n-1)*p(n-2,-x), with inputs p(0,x)= 1, p(1,x)= 1-x and G(n):= 1 - A000032(n)*x + (-1)^n*x^2. (Derived from Riordan's result and Knuth's exercise).
The row polynomials are the characteristic polynomials of product of the binomial matrix binomial(i,j) and the exchange matrix J_n (matrix with 1's on the antidiagonal, 0 elsewhere). - Paul Barry, Oct 05 2004

			Row polynomial for n=4: p(4,x) = 1-3*x-6*x^2+3*x^3+x^4 = (1+x-x^2)*(1-4*x-x^2). 1/p(4,x) is G.f. for A010048(n+3,3), n >= 0: {1,3,15,60,...} = A001655(n).
For n=3: 1*(Fibonacci(k))^3 - 3*(Fibonacci(k-1))^3 - 6*(Fibonacci(k-2))^3 + 3*(Fibonacci(k-3))^3 + 1*(Fibonacci(k-4))^3 = 0, k >= 4; inputs: (Fibonacci(k))^3, k=0..3.
The triangle begins:
  n\m 0   1     2    3     4      5     6    7   8   9
  0   1
  1   1  -1
  2   1  -1    -1
  3   1  -2    -2    1
  4   1  -3    -6    3     1
  5   1  -5   -15   15     5     -1
  6   1  -8   -40   60    40     -8    -1
  7   1 -13  -104  260   260   -104   -13    1
  8   1 -21  -273 1092  1820  -1092  -273   21   1
  9   1 -34  -714 4641 12376 -12376 -4641  714  34  -1
  ... [_Wolfdieter Lang_, Aug 06 2012; a(7,1) corrected, Oct 10 2012]

D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, 1969, Vol. 1, pp. 84-5 and 492.

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
Katharine A. Ahrens, Combinatorial Applications of the k-Fibonacci Numbers: A Cryptographically Motivated Analysis, Ph. D. thesis, North Carolina State University (2020).
A. T. Benjamin, S. S. Plott, A combinatorial approach to fibonomial coefficients, Fib. Quart. 46/47 (1) (2008/9) 7-9.
A. Brousseau, A sequence of power formulas, Fib. Quart., 6 (1968), 81-83.
H. W. Gould, Extensions of the Hermite g.c.d. theorems for binomial coefficients, Fib Quart. 33 (1995) 386.
E. Kilic, The generalized Fibonomial matrix, Eur. J. Combinat. 31 (1) (2010) 193-209.
Ron Knott, The Fibonomials
Ewa Krot, An introduction to finite fibonomial calculus, Centr. Eur. J. Math. 2 (5) (2004) 754.
A. K. Kwasniewski, Fibonomial cumulative connection constants, arXiv:math/0406006 [math.CO], 2004-2009.
Phakhinkon Phunphayap, Various Problems Concerning Factorials, Binomial Coefficients, Fibonomial Coefficients, and Palindromes, Ph. D. Thesis, Silpakorn University (Thailand 2021).
Phakhinkon Phunphayap, Prapanpong Pongsriiam, Explicit Formulas for the p-adic Valuations of Fibonomial Coefficients, J. Int. Seq. 21 (2018), #18.3.1.
J. Riordan, Generating functions for powers of Fibonacci numbers, Duke. Math. J. 29 (1962) 5-12.
J. Seibert and P. Trojovsky, On some identities for the Fibonomial coefficients, Math. Slov. 55 (2005) 9-19.
P. Trojovsky, On some identities for the Fibonomial coefficients..., Discr. Appl. Math. 155 (15) (2007) 2017.

Cf. A000032, A000045, A001654, A001655, A001656, A001657, A001658, A010048, A051159, A056565, A056566, A056567.
Sums include: A055871 (signed row), A056569 (row).
Central column: A003268.
Cf. A383715.

Fibonomial:= func< n,k | k eq 0 select 1 else (&*[Fibonacci(n-j+1)/Fibonacci(j): j in [1..k]]) >;
[(-1)^Floor((k+1)/2)*Fibonomial(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Jul 20 2024

A055870 := proc(n,k)
    (-1)^floor((k+1)/2)*A010048(n,k) ;
end proc: # R. J. Mathar, Jun 14 2015

T[n_, m_]:= {1,-1,-1,1}[[Mod[m,4] + 1]] * Product[ Fibonacci[n-j+1]/Fibonacci[j], {j, m}];
Table[T[n, m], {n, 0, 10}, {m, 0, n}]//Flatten (* Jean-François Alcover, Jul 05 2013 *)

def fibonomial(n,k): return 1 if k==0 else product(fibonacci(n-j+1)/fibonacci(j) for j in range(1,k+1))
flatten([[(-1)^((k+1)//2)*fibonomial(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 20 2024

T(n, m) = (-1)^floor((m+1)/2)*A010048(n, m), where A010048(n, m) := fibonomial(n, m).
G.f. for column m: (-1)^floor((m+1)/2)*x^m/p(m+1, x) with the row polynomial of the (signed) triangle: p(n, x) := Sum_{m=0..n} T(n, m)*x^m.
Sum_{k=0..n} T(n,k) * x^k = exp( -Sum_{k>=1} Fibonacci(n*k)/Fibonacci(k) * x^k/k ). - Seiichi Manyama, May 07 2025

A003267 Central Fibonomial coefficients.

Original entry on oeis.org

1, 1, 6, 60, 1820, 136136, 27261234, 14169550626, 19344810307020, 69056421075989160, 645693859487298425256, 15803204856220738696714416, 1012673098498882654470985390406, 169885799961166470686816475170920550, 74614732877610423587753604318734054624100

Offset: 0

N. J. A. Sloane

The largest prime factor of a(n): 1, 1, 3, 5, 13, 17, 89, 233, 233, 1597, 1597, 1597, 28657, 28657, 28657, 514229, 514229, 514229, 514229, 514229, 514229, 514229, 433494437, 433494437, 2971215073, ..., . The union of the above list is: 1, 3, 5, 13, 17, 89, 233, 1597, 28657, 514229, 433494437, 2971215073, 14736206161, 46165371073, 92180471494753, 99194853094755497, ... . - Robert G. Wilson v, Dec 04 2009

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

A. Brousseau, A sequence of power formulas, Fib. Quart., 6 (1968), 81-83.
A. Brousseau, Fibonacci and Related Number Theoretic Tables, Fibonacci Association, San Jose, CA, 1972, p. 74.
Phakhinkon Phunphayap, Various Problems Concerning Factorials, Binomial Coefficients, Fibonomial Coefficients, and Palindromes, Ph. D. Thesis, Silpakorn University (Thailand 2021).
Phakhinkon Phunphayap, Prapanpong Pongsriiam, Explicit Formulas for the p-adic Valuations of Fibonomial Coefficients, J. Int. Seq. 21 (2018), #18.3.1.
Eric Weisstein's World of Mathematics, Central Fibonomial Coefficient [From _Eric W. Weisstein_, Dec 08 2009]
Eric Weisstein's World of Mathematics, q-Binomial Coefficient.

Bisection of A003268. Cf. A008341.

Cf. A001622, A062073, A062381.

with(combinat): a := n -> product(fibonacci(n+k+1), k=0..n-1)/product(fibonacci(k), k=1..n):
seq(a(n), n=0..20);

f[n_] := Product[Fibonacci[n + k + 1]/Fibonacci[k + 1], {k, 0, n - 1}]; Array[f, 14, 0] (* Robert G. Wilson v, Dec 04 2009 *)
Flatten[{1, Table[Round[-(GoldenRatio^(n^2) QPochhammer[(-1)^n GoldenRatio^(-2 n), -GoldenRatio^-2, 1 + n])/((-1 + (-1)^n GoldenRatio^(-2 n)) QPochhammer[ -GoldenRatio^-2, -GoldenRatio^-2, n])], {n,1,15}]}]  (* Vaclav Kotesovec, Apr 10 2015 after Eric W. Weisstein *)
Round@Table[GoldenRatio^(n^2) QBinomial[2 n, n, -1/GoldenRatio^2], {n, 0, 20}] (* Round is equivalent to FullSimplify here, but is much faster - Vladimir Reshetnikov, Sep 25 2016 *)

a(n)=prod(k=0,n-1,fibonacci(n+k+1))/prod(k=1,n,fibonacci(k))
for(n=0,14,print1(a(n),","))

For n > 0, a(n) = (-1)^floor(n/2)*det(M(n, -1))/det(M(n, 0)) where M(n, m) is the n X n matrix with coefficient 1/F(i+j+m), i=1..n, j=1..n. - Benoit Cloitre, Jun 05 2004
For n > 0, a(n) = -(GoldenRatio^(n^2) QPochhammer[(-1)^n GoldenRatio^(-2 n), -GoldenRatio^-2, 1 + n])/((-1 + (-1)^n GoldenRatio^(-2 n)) QPochhammer[ -GoldenRatio^-2, -GoldenRatio^-2, n]). - Eric W. Weisstein, Dec 08 2009
a(n) ~ phi^(n^2) / C, where phi = A001622 = (1+sqrt(5))/2 is the golden ratio and C = A062073 = 1.22674201072035324441763... is the Fibonacci factorial constant. - Vaclav Kotesovec, Apr 10 2015
a(n) = phi^(n^2) * C(2*n, n)A001622%20is%20the%20golden%20ratio,%20and%20C(n,%20k)_q%20is%20the%20q-binomial%20coefficient.%20-%20_Vladimir%20Reshetnikov">{-1/phi^2}, where phi = (1+sqrt(5))/2 = A001622 is the golden ratio, and C(n, k)_q is the q-binomial coefficient. - _Vladimir Reshetnikov, Sep 26 2016
a(n) = A010048(2*n, n). - Vladimir Reshetnikov, Sep 27 2016

More terms from Sascha Kurz and Rick L. Shepherd, Mar 24 2002
a(1) = 1 added by N. J. A. Sloane, Dec 06 2009
Typo in second formula corrected by Vaclav Kotesovec, Apr 10 2015
Offset corrected from 1 to 0, formulae and programs are updated accordingly by Vladimir Reshetnikov, Sep 27 2016

cp's OEIS Frontend

A010048 Triangle of Fibonomial coefficients, read by rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

SageMath

Formula

A062073 Decimal expansion of Fibonacci factorial constant.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A055870 Signed Fibonomial triangle.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

SageMath

Formula

A003267 Central Fibonomial coefficients.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A271421 a(n) = fibonorial(3*n)/(fibonorial(2*n+1)*fibonorial(n+1)), where fibonorial(n) = A003266(n).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Formula

A271421 a(n) = fibonorial(3n)/(fibonorial(2n+1)*fibonorial(n+1)), where fibonorial(n) = A003266(n).