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.

A166470 a(n) = 2^F(n+1)*3^F(n), where F(n) is the n-th Fibonacci number, A000045(n).

Table of values

n a(n)
0 2
1 6
2 12
3 72
4 864
5 62208
6 53747712
7 3343537668096
8 179707499645975396352
9 600858794305667322270155425185792
10 107978831564966913814384922944738457859243070439030784

List of values

[2, 6, 12, 72, 864, 62208, 53747712, 3343537668096, 179707499645975396352, 600858794305667322270155425185792, 107978831564966913814384922944738457859243070439030784]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.