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.

A092038 a(n+1) = a(n) + (a(n) mod 2)^(n mod a(n)), a(1) = 1.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 4
7 4
8 5
9 6
10 6
11 6
12 7
13 8
14 8
15 8
16 9
17 10
18 10
19 10
20 11
21 12
22 12
23 12
24 13
25 14
26 14
27 14
28 15
29 16
30 16
31 16
32 17
33 18
34 18
35 18
36 19
37 20
38 20
39 20
40 21
41 22
42 22
43 22
44 23
45 24
46 24
47 24
48 25
49 26
50 26
51 26
52 27
53 28
54 28
55 28
56 29
57 30
58 30
59 30
60 31
61 32
62 32
63 32
64 33
65 34
66 34
67 34
68 35
69 36
70 36
71 36
72 37
73 38
74 38

List of values

[1, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 13, 14, 14, 14, 15, 16, 16, 16, 17, 18, 18, 18, 19, 20, 20, 20, 21, 22, 22, 22, 23, 24, 24, 24, 25, 26, 26, 26, 27, 28, 28, 28, 29, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 35, 36, 36, 36, 37, 38, 38]

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

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