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.

A113829 a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence of numbers that are congruent to {0,3,4,5,7,8} mod 12.

Table of values

n a(n)
1 1
2 9
3 25
4 57
5 185
6 441
7 4537
8 37305
9 102841
10 233913
11 758201
12 1806777
13 18583993
14 152801721
15 421237177
16 958108089
17 3105591737
18 7400559033
19 76120035769
20 625875849657
21 1725387477433
22 3924410732985
23 12720503755193
24 30312689799609

List of values

[1, 9, 25, 57, 185, 441, 4537, 37305, 102841, 233913, 758201, 1806777, 18583993, 152801721, 421237177, 958108089, 3105591737, 7400559033, 76120035769, 625875849657, 1725387477433, 3924410732985, 12720503755193, 30312689799609]