login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003267 Central Fibonomial coefficients.
(Formerly M4272)
1
1, 1, 6, 60, 1820, 136136, 27261234, 14169550626, 19344810307020, 69056421075989160, 645693859487298425256, 15803204856220738696714416, 1012673098498882654470985390406, 169885799961166470686816475170920550 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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, ..., . [From Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 04 2009]

REFERENCES

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.

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

LINKS

Eric Weisstein's World of Mathematics, Central Fibonomial Coefficient [From Eric W. Weisstein (eric(AT)weisstein.com), Dec 08 2009]

FORMULA

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) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 05 2004

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] [From Eric W. Weisstein (eric(AT)weisstein.com), Dec 08 2009]

MAPLE

with(combinat); a[n] := product(fibonacci(n+k), k=0..n-2)/product(fibonacci(k), k=1..n-1);

MATHEMATICA

f[n_] := Product[ Fibonacci[n + k]/Fibonacci[k + 1], {k, 0, n - 2}]; Array[ f, 14] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 04 2009]

PROG

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

CROSSREFS

Bisection of A003268. Cf. A008341.

Cf. A062381.

Sequence in context: A061573 A092356 A001416 * A010574 A082681 A061431

Adjacent sequences:  A003264 A003265 A003266 * A003268 A003269 A003270

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de) and Rick L. Shepherd (rshepherd2(AT)hotmail.com), Mar 24 2002

a(1) = 1 added by N. J. A. Sloane, Dec 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.