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.

A109534 a(0)=1, a(n)=n+a(n-1) if n mod 2=0, a(n)=3n-a(n-1) if n mod 2 = 1.

Table of values

n a(n)
0 1
1 2
2 4
3 5
4 9
5 6
6 12
7 9
8 17
9 10
10 20
11 13
12 25
13 14
14 28
15 17
16 33
17 18
18 36
19 21
20 41
21 22
22 44
23 25
24 49
25 26
26 52
27 29
28 57
29 30
30 60
31 33
32 65
33 34
34 68
35 37
36 73
37 38
38 76
39 41
40 81
41 42
42 84
43 45
44 89
45 46
46 92
47 49
48 97
49 50
50 100
51 53
52 105
53 54
54 108
55 57
56 113
57 58
58 116
59 61
60 121
61 62
62 124
63 65
64 129
65 66
66 132
67 69
68 137

List of values

[1, 2, 4, 5, 9, 6, 12, 9, 17, 10, 20, 13, 25, 14, 28, 17, 33, 18, 36, 21, 41, 22, 44, 25, 49, 26, 52, 29, 57, 30, 60, 33, 65, 34, 68, 37, 73, 38, 76, 41, 81, 42, 84, 45, 89, 46, 92, 49, 97, 50, 100, 53, 105, 54, 108, 57, 113, 58, 116, 61, 121, 62, 124, 65, 129, 66, 132, 69, 137]

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

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