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.

A002804 (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.

Table of values

n a(n)
1 1
2 4
3 9
4 19
5 37
6 73
7 143
8 279
9 548
10 1079
11 2132
12 4223
13 8384
14 16673
15 33203
16 66190
17 132055
18 263619
19 526502
20 1051899
21 2102137
22 4201783
23 8399828
24 16794048
25 33579681
26 67146738
27 134274541
28 268520676
29 536998744
30 1073933573
31 2147771272
32 4295398733
33 8590581749

List of values

[1, 4, 9, 19, 37, 73, 143, 279, 548, 1079, 2132, 4223, 8384, 16673, 33203, 66190, 132055, 263619, 526502, 1051899, 2102137, 4201783, 8399828, 16794048, 33579681, 67146738, 134274541, 268520676, 536998744, 1073933573, 2147771272, 4295398733, 8590581749]

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

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