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.

A216021 a(n) = modlg(n^n, 2^n), where modlg is the function defined in A215894: modlg(a,b) = floor(a / b^floor(logb(a))), logb is the logarithm base b.

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 3
6 11
7 50
8 1
9 2
10 9
11 33
12 129
13 550
14 2526
15 12445
16 1
17 2
18 8
19 26
20 86
21 302
22 1103
23 4216
24 16834
25 70064
26 303520
27 1366413
28 6383595
29 30907397
30 154895272
31 802588710
32 1
33 2
34 7
35 23
36 69
37 215
38 685
39 2242
40 7523
41 25881
42 91237
43 329377
44 1217078
45 4600595
46 17781207
47 70234475

List of values

[1, 1, 3, 1, 3, 11, 50, 1, 2, 9, 33, 129, 550, 2526, 12445, 1, 2, 8, 26, 86, 302, 1103, 4216, 16834, 70064, 303520, 1366413, 6383595, 30907397, 154895272, 802588710, 1, 2, 7, 23, 69, 215, 685, 2242, 7523, 25881, 91237, 329377, 1217078, 4600595, 17781207, 70234475]