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.

A371985 For n a power of 2, a(n) = n. Otherwise a(n) is the smallest novel multiple of a(n - 2^m), where 2^m is the greatest power of 2 not exceeding n.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 9
8 8
9 7
10 10
11 12
12 20
13 15
14 18
15 27
16 16
17 11
18 14
19 21
20 24
21 25
22 30
23 36
24 40
25 28
26 50
27 48
28 60
29 45
30 54
31 81
32 32
33 13
34 22
35 33
36 44
37 35
38 42
39 63
40 56
41 49
42 70
43 72
44 80
45 75
46 90
47 108
48 96
49 55
50 84
51 105
52 120
53 100
54 150
55 144
56 160
57 112
58 200
59 192
60 180
61 135
62 162
63 243
64 64
65 17

List of values

[1, 2, 3, 4, 5, 6, 9, 8, 7, 10, 12, 20, 15, 18, 27, 16, 11, 14, 21, 24, 25, 30, 36, 40, 28, 50, 48, 60, 45, 54, 81, 32, 13, 22, 33, 44, 35, 42, 63, 56, 49, 70, 72, 80, 75, 90, 108, 96, 55, 84, 105, 120, 100, 150, 144, 160, 112, 200, 192, 180, 135, 162, 243, 64, 17]

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

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