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.

A146085 Positive integers a(n) such that for every integer m == 1 (mod 3), m >= 4, there exists a unique representation of m as a sum of the form a(l) + 3*a(s).

Table of values

n a(n)
1 1
2 4
3 7
4 28
5 31
6 34
7 55
8 58
9 61
10 244
11 247
12 250
13 271
14 274
15 277
16 298
17 301
18 304
19 487
20 490
21 493
22 514
23 517
24 520
25 541
26 544
27 547
28 2188
29 2191
30 2194
31 2215
32 2218
33 2221
34 2242
35 2245
36 2248
37 2431
38 2434
39 2437
40 2458
41 2461
42 2464
43 2485
44 2488
45 2491
46 2674
47 2677
48 2680
49 2701
50 2704
51 2707
52 2728
53 2731
54 2734

List of values

[1, 4, 7, 28, 31, 34, 55, 58, 61, 244, 247, 250, 271, 274, 277, 298, 301, 304, 487, 490, 493, 514, 517, 520, 541, 544, 547, 2188, 2191, 2194, 2215, 2218, 2221, 2242, 2245, 2248, 2431, 2434, 2437, 2458, 2461, 2464, 2485, 2488, 2491, 2674, 2677, 2680, 2701, 2704, 2707, 2728, 2731, 2734]