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.

A350537 Smallest number m > 1 such that (2n+1)*m = A350536(n) contains only odd digits.

Table of values

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

List of values

[3, 3, 3, 5, 11, 3, 3, 5, 3, 3, 15, 5, 3, 5, 11, 3, 3, 5, 3, 3, 13, 13, 3, 11, 11, 3, 3, 13, 3, 3, 13, 5, 3, 5, 11, 5, 7, 5, 7, 5, 17, 11, 7, 11, 11, 21, 15, 21, 35, 101, 11, 5, 3, 5, 11, 3, 3, 5, 3, 3, 11, 11, 3, 11, 15, 3, 3, 13, 7, 7, 11, 5, 11, 5, 13, 5, 9, 5, 47, 5]

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

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