A363847 - cp's OEIS frontend

A363847 Numbers k such that Omega(m(m+1)) < Omega(k(k+1)) for all m < k, where Omega(k) is the number of prime divisors of k counted with multiplicity (A001222).

n	a(n)
1	1
2	2
3	3
4	7
5	8
6	15
7	32
8	63
9	224
10	255
11	512
12	3968
13	4095
14	14336
15	32768
16	65535
17	180224
18	262143
19	1048575
20	14680064
21	16777215
22	134217728
23	268435455
24	1073741823
25	8589934592
26	12884901887
27	34359738368
28	68719476735
29	1099511627775
30	4398046511103
31	17592186044415
32	35184372088832

[1, 2, 3, 7, 8, 15, 32, 63, 224, 255, 512, 3968, 4095, 14336, 32768, 65535, 180224, 262143, 1048575, 14680064, 16777215, 134217728, 268435455, 1073741823, 8589934592, 12884901887, 34359738368, 68719476735, 1099511627775, 4398046511103, 17592186044415, 35184372088832]

cp's OEIS Frontend

A363847 Numbers k such that Omega(m(m+1)) < Omega(k(k+1)) for all m < k, where Omega(k) is the number of prime divisors of k counted with multiplicity (A001222).

Table of values

List of values

cp's OEIS Frontend

A363847 Numbers k such that Omega(m*(m+1)) < Omega(k*(k+1)) for all m < k, where Omega(k) is the number of prime divisors of k counted with multiplicity (A001222).

Table of values

List of values

A363847 Numbers k such that Omega(m(m+1)) < Omega(k(k+1)) for all m < k, where Omega(k) is the number of prime divisors of k counted with multiplicity (A001222).