login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050615 Products of distinct terms of Fibonacci(2^(i+2)): a(n) = Product_{i=0..floor(log_2(n+1))} F(2^(i+2))^bit(n,i). 1
1, 3, 21, 63, 987, 2961, 20727, 62181, 2178309, 6534927, 45744489, 137233467, 2149990983, 6449972949, 45149810643, 135449431929, 10610209857723, 31830629573169, 222814407012183, 668443221036549, 10472277129572601 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
MAPLE
distinct_fib_products := n -> product('fib(2^(i+2))^bit_i(n, i)', 'i'=0..floor_log_2(n+1));
CROSSREFS
Sequence in context: A328042 A331082 A117984 * A145658 A342548 A188667
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 02 1999
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)