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.

A305860 Triangle m(n,k) read by rows (n >= 0, 0 <= k <= n): to get the binary expansion of m(n,k), for 0 <= i < 2^n, write 1 if the binary weight of i is equal to k or 0 otherwise, left to right.

Table of values

n a(n)
0 1
1 2
2 1
3 8
4 6
5 1
6 128
7 104
8 22
9 1
10 32768
11 26752
12 5736
13 278
14 1
15 2147483648
16 1753251840
17 375941248
18 18224744
19 65814
20 1
21 9223372036854775808
22 7530159316599308288
23 1614655367130677248
24 78274679833913472
25 282668995843688
26 4295033110
27 1

List of values

[1, 2, 1, 8, 6, 1, 128, 104, 22, 1, 32768, 26752, 5736, 278, 1, 2147483648, 1753251840, 375941248, 18224744, 65814, 1, 9223372036854775808, 7530159316599308288, 1614655367130677248, 78274679833913472, 282668995843688, 4295033110, 1]