cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A359458 a(n) = A001911(n)*A003266(n+2).

Original entry on oeis.org

0, 2, 18, 180, 2640, 59280, 2096640, 118067040, 10659448800, 1548438091200, 362727075110400, 137200338475200000, 83862700757150515200, 82876486430812314240000, 132456397879190606981760000, 342431262483097194433458432000, 1432128704666605129972385934336000
Offset: 0

Views

Author

A.H.M. Smeets, Jan 03 2023

Keywords

Comments

Terms of the form 10^a(n)-1 for n>0 occur as large terms in the continued fraction expansion A359457 of the constant A359456.

Crossrefs

Formula

a(n) = (Sum_{i = 1..n} Fibonacci(i+1)) * (Product_{i = 1..n} Fibonacci(i+1)), with Fibonacci(k) = A000045(k).