Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123741
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123741 A second version of Fibonacci factorials besides A003266. +0
2
1, 2, 24, 630, 52800, 11381760, 6738443712, 10487895163200, 43294107630090240, 469590163875486482400, 13388418681612808458240000, 1001088091286168023193223168000, 196239953628635168336022309340569600 (list; graph; listen)
OFFSET

1,2

COMMENT

The formula below is a generalization of n! = product((n+1)-j,j=1..n) with numbers k replaced by Fibonacci numbers F(k+1):=A000045(k+1), k>=1.

These numbers come up in Vandermonde determinants involving Fibonacci numbers [F(2),...,F(n+1)]. See A123742.

FORMULA

a(n)= product(F(n+2)-F(j+1),j=1..n), n>=1.

EXAMPLE

n=3: (5-1)*(5-2)*(5-3)=4*3*2=24; n=4: (8-1)*(8-2)*(8-3)*(8-5)=7*6*5*3=630.

CROSSREFS

Cf. A003266(n+1):= product(F(j+1), j=1..n), n>=1, the usual Fibonacci factorials.

Sequence in context: A089835 A009251 A009447 this_sequence A012216 A012118 A012375

Adjacent sequences: A123738 A123739 A123740 this_sequence A123742 A123743 A123744

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Oct 13 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research