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.

A230639 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 B(n).

Table of values

n a(n)
2 1
3 3
4 5
5 17
6 29
7 139
8 249
9 64570209
10 129140169
11 34315253252541
12 68630377364913
13 1044297913696328396542704032390321722034449074468444246791788357605
14 2088595827392656793085408064780643444068898148936888424953199350297

List of values

[1, 3, 5, 17, 29, 139, 249, 64570209, 129140169, 34315253252541, 68630377364913, 1044297913696328396542704032390321722034449074468444246791788357605, 2088595827392656793085408064780643444068898148936888424953199350297]