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.

A279237 Let k_i be the multiplicity of prime(i) in the prime factorization of the n-th composite number C_n, and let k_i=0 if prime(i) is not a factor of C_n. Then a(n)=1*k_1+10*k_2+100*k_3+...+10^N*k_N, where N is the index of the largest prime factor in C_n.

Table of values

n a(n)
1 2
2 11
3 3
4 20
5 101
6 12
7 1001
8 110
9 4
10 21
11 102
12 1010
13 10001
14 13
15 200
16 100001
17 30
18 1002
19 111
20 5
21 10010
22 1000001
23 1100
24 22
25 10000001
26 100010
27 103
28 1011
29 10002
30 120
31 100000001
32 14
33 2000
34 201
35 1000010
36 100002
37 31
38 10100
39 1003
40 10000010
41 1000000001
42 112
43 10000000001
44 1020
45 6
46 100100
47 10011
48 1000002

List of values

[2, 11, 3, 20, 101, 12, 1001, 110, 4, 21, 102, 1010, 10001, 13, 200, 100001, 30, 1002, 111, 5, 10010, 1000001, 1100, 22, 10000001, 100010, 103, 1011, 10002, 120, 100000001, 14, 2000, 201, 1000010, 100002, 31, 10100, 1003, 10000010, 1000000001, 112, 10000000001, 1020, 6, 100100, 10011, 1000002]