A298009 - cp's OEIS frontend

A298009 a(n) = f(n-1,n)+(n-1)k, n>=1, where the function f(a,b) gives the number of prime numbers in the range [ak,b*k[ with k=10^p. For this sequence we use p=2.

n	a(n)
1	25
2	121
3	216
4	316
5	417
6	514
7	616
8	714
9	815
10	914
11	1016
12	1112
13	1215
14	1311
15	1417
16	1512
17	1615
18	1712
19	1812
20	1913
21	2014
22	2110
23	2215
24	2315
25	2410
26	2511
27	2615
28	2714
29	2812
30	2911
31	3012
32	3110
33	3211
34	3315
35	3411
36	3514
37	3613
38	3712
39	3811
40	3911
41	4015
42	4109
43	4216
44	4309
45	4411
46	4512
47	4612
48	4712
49	4808
50	4915

[25, 121, 216, 316, 417, 514, 616, 714, 815, 914, 1016, 1112, 1215, 1311, 1417, 1512, 1615, 1712, 1812, 1913, 2014, 2110, 2215, 2315, 2410, 2511, 2615, 2714, 2812, 2911, 3012, 3110, 3211, 3315, 3411, 3514, 3613, 3712, 3811, 3911, 4015, 4109, 4216, 4309, 4411, 4512, 4612, 4712, 4808, 4915]

cp's OEIS Frontend

A298009 a(n) = f(n-1,n)+(n-1)k, n>=1, where the function f(a,b) gives the number of prime numbers in the range [ak,b*k[ with k=10^p. For this sequence we use p=2.

Table of values

List of values

cp's OEIS Frontend

A298009 a(n) = f(n-1,n)+(n-1)*k, n>=1, where the function f(a,b) gives the number of prime numbers in the range [a*k,b*k[ with k=10^p. For this sequence we use p=2.

Table of values

List of values

A298009 a(n) = f(n-1,n)+(n-1)k, n>=1, where the function f(a,b) gives the number of prime numbers in the range [ak,b*k[ with k=10^p. For this sequence we use p=2.