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.

A362531 The smallest integer m such that m mod 2k >= k for k = 1, 2, 3, ..., n.

Table of values

n a(n)
1 1
2 3
3 3
4 15
5 15
6 47
7 95
8 95
9 287
10 335
11 1199
12 1199
13 1295
14 2015
15 2879
16 2879
17 2879
18 2879
19 2879
20 2879
21 2879
22 43199
23 211679
24 211679
25 211679
26 211679
27 211679
28 211679
29 211679
30 211679
31 3084479
32 3084479
33 3084479
34 3084479
35 3084479
36 3084479
37 302702399
38 469909439

List of values

[1, 3, 3, 15, 15, 47, 95, 95, 287, 335, 1199, 1199, 1295, 2015, 2879, 2879, 2879, 2879, 2879, 2879, 2879, 43199, 211679, 211679, 211679, 211679, 211679, 211679, 211679, 211679, 3084479, 3084479, 3084479, 3084479, 3084479, 3084479, 302702399, 469909439]

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

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