Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082480
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082480 a(n)=product(k=1,n,F(k)+1) where F(k) denotes the k-th Fibonacci number. +0
2
1, 2, 4, 12, 48, 288, 2592, 36288, 798336, 27941760, 1564738560, 140826470400, 20419838208000, 4778242140672000, 1806175529174016000, 1103573248325323776000, 1090330369345419890688000 (list; graph; listen)
OFFSET

0,2

COMMENT

Equals row sums (unsigned) of triangle A158472 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 20 2009]

MAPLE

restart:with (combinat):a:= proc(n) option remember; if n=0 then 1 else mul((fibonacci(j)+1), j=1..n-1) fi end: seq (a(n), n=1..17); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 29 2009]

PROGRAM

(PARI) a(n)=prod(k=1, n, fibonacci(k)+1)

CROSSREFS

A158472 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 20 2009]

Sequence in context: A030949 A030888 A030801 this_sequence A093934 A109458 A030963

Adjacent sequences: A082477 A082478 A082479 this_sequence A082481 A082482 A082483

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 27 2003

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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research