A092479 - cp's OEIS frontend

A092479 T(n,k) is the number of numbers <= 2^n having exactly k prime factors (with repetitions), 0<=k<=n, triangle read by rows.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	4
8	2
9	1
10	1
11	6
12	6
13	2
14	1
15	1
16	11
17	10
18	7
19	2
20	1
21	1
22	18
23	22
24	13
25	7
26	2
27	1
28	1
29	31
30	42
31	30
32	14
33	7
34	2
35	1
36	1
37	54
38	82
39	60
40	34
41	15
42	7
43	2
44	1
45	1
46	97
47	157
48	125
49	71
50	36
51	15
52	7
53	2
54	1
55	1
56	172
57	304
58	256
59	152
60	77
61	37
62	15
63	7
64	2
65	1
66	1
67	309
68	589
69	513
70	325
71	168
72	81
73	37
74	15
75	7
76	2
77	1
78	1
79	564
80	1124
81	1049
82	669
83	367
84	177
85	83
86	37
87	15
88	7
89	2
90	1

[1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 6, 6, 2, 1, 1, 11, 10, 7, 2, 1, 1, 18, 22, 13, 7, 2, 1, 1, 31, 42, 30, 14, 7, 2, 1, 1, 54, 82, 60, 34, 15, 7, 2, 1, 1, 97, 157, 125, 71, 36, 15, 7, 2, 1, 1, 172, 304, 256, 152, 77, 37, 15, 7, 2, 1, 1, 309, 589, 513, 325, 168, 81, 37, 15, 7, 2, 1, 1, 564, 1124, 1049, 669, 367, 177, 83, 37, 15, 7, 2, 1]

cp's OEIS Frontend

A092479 T(n,k) is the number of numbers <= 2^n having exactly k prime factors (with repetitions), 0<=k<=n, triangle read by rows.

Table of values

List of values