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.

A062559 A B2 sequence consisting of powers of primes but not primes: a(n) = least value from A025475 such that sequence increases and pairwise sums of distinct elements are all distinct.

Table of values

n a(n)
0 4
1 8
2 9
3 16
4 25
5 27
6 49
7 64
8 121
9 243
10 256
11 343
12 512
13 729
14 961
15 1024
16 1331
17 1369
18 1849
19 2048
20 2187
21 2197
22 2401
23 3125
24 3481
25 4096
26 4913
27 5329
28 6561
29 6859
30 6889
31 8192
32 10201
33 12769
34 14641
35 15625
36 16384
37 16807
38 19683
39 22201
40 22801
41 27889
42 28561
43 29791
44 32768

List of values

[4, 8, 9, 16, 25, 27, 49, 64, 121, 243, 256, 343, 512, 729, 961, 1024, 1331, 1369, 1849, 2048, 2187, 2197, 2401, 3125, 3481, 4096, 4913, 5329, 6561, 6859, 6889, 8192, 10201, 12769, 14641, 15625, 16384, 16807, 19683, 22201, 22801, 27889, 28561, 29791, 32768]