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.

A230640 Let M(1)=0 and for n>1, B(n)=(M(ceiling(n/2))+M(floor(n/2))+2)/2, M(n)=3^B(n)+M(floor(n/2))+1. This sequence gives M(n).

Table of values

n a(n)
1 0
2 4
3 28
4 248
5 129140168
6 68630377364912
7 2088595827392656793085408064780643444068898148936888424953199350296

List of values

[0, 4, 28, 248, 129140168, 68630377364912, 2088595827392656793085408064780643444068898148936888424953199350296]

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

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