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.

A094096 Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.

Table of values

n a(n)
1 1
2 5
3 1
4 494
5 533
6 133
7 1
8 361131
9 998130
10 318354
11 389455
12 275577
13 42778
14 14162
15 1
16 4436526107
17 21759994113
18 223006618265
19 97254937860
20 19669357917

List of values

[1, 5, 1, 494, 533, 133, 1, 361131, 998130, 318354, 389455, 275577, 42778, 14162, 1, 4436526107, 21759994113, 223006618265, 97254937860, 19669357917]