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.

A276401 If n mod 3 = 0 then a(n) = 3^(n/3) + 12*n, if n mod 3 = 1 then a(n) = 4*3^((n-4)/3) + 12*n + 51, otherwise a(n) = 2*3^((n-2)/3) + 12*n - 36.

Table of values

n a(n)
3 39
4 103
5 30
6 81
7 147
8 78
9 135
10 207
11 150
12 225
13 315
14 294
15 423
16 567
17 654
18 945
19 1251
20 1662
21 2439
22 3231
23 4614
24 6849
25 9099
26 13398
27 20007
28 26631
29 39678
30 59409
31 79155
32 118446
33 177543
34 236655
35 354678
36 531873
37 709083
38 1063302
39 1594791
40 2126295
41 3189102
42 4783473
43 6377859

List of values

[39, 103, 30, 81, 147, 78, 135, 207, 150, 225, 315, 294, 423, 567, 654, 945, 1251, 1662, 2439, 3231, 4614, 6849, 9099, 13398, 20007, 26631, 39678, 59409, 79155, 118446, 177543, 236655, 354678, 531873, 709083, 1063302, 1594791, 2126295, 3189102, 4783473, 6377859]