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.

A068857 a(0) = 0, a(1) = 8; for n>=2: a(n) = smallest multiple of a(n-1) which is of the form 2k*(2k+2).

Table of values

n a(n)
0 0
1 8
2 24
3 48
4 288
5 16128
6 11950848
7 4636929024
8 88106288385024
9 8038489644431643930624
10 15177535939786079616000991061008232448
11 40096515501441989312471498490435884509054125751527350190658560000

List of values

[0, 8, 24, 48, 288, 16128, 11950848, 4636929024, 88106288385024, 8038489644431643930624, 15177535939786079616000991061008232448, 40096515501441989312471498490435884509054125751527350190658560000]