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.

A216469 a(n) = smallest m such that 2n-1 | (2^m+1)/3, or 0 if no such m exists.

Table of values

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

List of values

[1, 3, 0, 0, 9, 5, 0, 0, 0, 9, 0, 0, 0, 27, 0, 0, 15, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 9, 29, 0, 0, 0, 33, 0, 0, 0, 0, 0, 0, 81, 41, 0, 0, 0, 0, 0, 0, 0, 45, 0, 0, 0, 53, 0, 0, 0, 0, 0, 0, 55, 0, 0, 0, 21, 65, 0, 0, 0, 69, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 81, 0, 0]

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

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