A050767 - cp's OEIS frontend

A050767 Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.

n	a(n)
0	11
1	23
2	83
3	149
4	167
5	251
6	269
7	881
8	2039
9	5021
10	9311
11	35111
12	82219
13	89809
14	181421
15	289099
16	420899
17	885839
18	996157
19	1963799
20	2554439
21	2843903
22	3269039
23	3632701
24	4648519
25	6448103
26	9748579
27	35200439
28	71927183
29	82216501
30	283709077

[11, 23, 83, 149, 167, 251, 269, 881, 2039, 5021, 9311, 35111, 82219, 89809, 181421, 289099, 420899, 885839, 996157, 1963799, 2554439, 2843903, 3269039, 3632701, 4648519, 6448103, 9748579, 35200439, 71927183, 82216501, 283709077]

cp's OEIS Frontend

A050767 Let f(m) = smallest composite number that takes m steps of "add prime factors to number" to reach a prime and g(m) be the prime that is reached. Sequence gives values of g(m), sorted and duplicates removed.

Table of values

List of values