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.

A336823 a(1)=1; thereafter a(n) = a(n-1) / wt(n-1) if wt(n-1) divides a(n-1), otherwise a(n) = a(n-1) * wt(n-1) where wt(n) is the binary weight of n.

Table of values

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

List of values

[1, 1, 1, 2, 2, 1, 2, 6, 6, 3, 6, 2, 1, 3, 1, 4, 4, 2, 1, 3, 6, 2, 6, 24, 12, 4, 12, 3, 1, 4, 1, 5, 5, 10, 5, 15, 30, 10, 30, 120, 60, 20, 60, 15, 5, 20, 5, 1, 2, 6, 2, 8, 24, 6, 24, 120, 40, 10, 40, 8, 2, 10, 2, 12, 12, 6, 3, 1, 2, 6, 2, 8, 4, 12, 4, 1, 3, 12]

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

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