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).

This page as a plain text file.
%I A359458 #21 Feb 20 2023 13:05:46
%S A359458 0,2,18,180,2640,59280,2096640,118067040,10659448800,1548438091200,
%T A359458 362727075110400,137200338475200000,83862700757150515200,
%U A359458 82876486430812314240000,132456397879190606981760000,342431262483097194433458432000,1432128704666605129972385934336000
%N A359458 a(n) = A001911(n)*A003266(n+2).
%C A359458 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.
%H A359458 Winston de Greef, <a href="/A359458/b359458.txt">Table of n, a(n) for n = 0..95</a>
%F A359458 a(n) = (Sum_{i = 1..n} Fibonacci(i+1)) * (Product_{i = 1..n} Fibonacci(i+1)), with Fibonacci(k) = A000045(k).
%Y A359458 Cf. A000045, A001911, A003266, A359456, A359457.
%K A359458 nonn,easy
%O A359458 0,2
%A A359458 _A.H.M. Smeets_, Jan 03 2023