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.

A270438 a(n) is the number of entries == 1 mod 4 in row n of Pascal's triangle.

Table of values

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

List of values

[1, 2, 2, 2, 2, 4, 2, 4, 2, 4, 4, 4, 2, 4, 4, 8, 2, 4, 4, 4, 4, 8, 4, 8, 2, 4, 4, 8, 4, 8, 8, 16, 2, 4, 4, 4, 4, 8, 4, 8, 4, 8, 8, 8, 4, 8, 8, 16, 2, 4, 4, 8, 4, 8, 8, 16, 4, 8, 8, 16, 8, 16, 16, 32, 2, 4, 4, 4, 4, 8, 4, 8, 4, 8, 8, 8, 4, 8, 8, 16, 4, 8, 8]