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.

A327491 a(0) = 0. If 4 divides n then a(n) = valuation(n, 2) else a(n) = (n mod 2) + 1.

Table of values

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

List of values

[0, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 5, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 6, 2, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2]

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

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