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.

A374911 a(n) = a(2^n mod n) + a(3^n mod n), with a(0) = 1.

Table of values

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

List of values

[1, 2, 3, 4, 3, 7, 7, 7, 3, 4, 7, 7, 7, 7, 7, 10, 3, 7, 11, 7, 5, 10, 7, 7, 7, 18, 7, 8, 21, 7, 7, 7, 3, 11, 7, 18, 25, 7, 7, 11, 5, 7, 17, 7, 10, 18, 7, 7, 14, 14, 21, 11, 10, 7, 29, 14, 7, 11, 7, 7, 13, 7, 7, 11, 3, 17, 7, 7, 10, 11, 21, 7, 7, 7, 7, 21, 10, 32, 11, 7, 5, 6, 7, 7, 14, 10, 7, 11, 19]

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

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