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.

A334878 For any n > 0 with prime factorization Product_{k > 0} prime(k)^e_k (where prime(k) denotes the k-th prime number), let b_k = 1 + max_{k > 0} e_k; a(n) = Sum_{k > 0} e_k * b_k^(k-1).

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 4
6 3
7 8
8 3
9 6
10 5
11 16
12 5
13 32
14 9
15 6
16 4
17 64
18 7
19 128
20 11
21 10
22 17
23 256
24 7
25 18
26 33
27 12
28 29
29 512
30 7
31 1024
32 5
33 18
34 65
35 12
36 8
37 2048
38 129
39 34
40 19
41 4096
42 11
43 8192
44 83
45 15
46 257
47 16384
48 9
49 54
50 19
51 66
52 245
53 32768
54 13
55 20
56 67
57 130
58 513
59 65536
60 14
61 131072
62 1025

List of values

[0, 1, 2, 2, 4, 3, 8, 3, 6, 5, 16, 5, 32, 9, 6, 4, 64, 7, 128, 11, 10, 17, 256, 7, 18, 33, 12, 29, 512, 7, 1024, 5, 18, 65, 12, 8, 2048, 129, 34, 19, 4096, 11, 8192, 83, 15, 257, 16384, 9, 54, 19, 66, 245, 32768, 13, 20, 67, 130, 513, 65536, 14, 131072, 1025]