login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354840 a(n) is the smallest number k such that A275235(k) = n. 1
1, 4, 9, 16, 35, 57, 93, 222, 427, 819, 1257, 1270, 1276, 2651, 5806, 13673, 19366, 19372, 27723, 108857, 113036, 113038, 115748, 524856, 560074, 1006146, 1219767, 1652728, 2704892, 2704894, 8756936, 21401949, 21401979, 40268383, 40268435, 40268437, 167540089, 167540101 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Equivalently, the smallest integer k such that the number of primes between k and k+log(k)^2, exclusive, is n.
Up to a(37) = 167540101, the last known term, this sequence is monotonic.
REFERENCES
Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section A2, Primes connected with factorials, p. 11.
LINKS
EXAMPLE
In the interval ]9; 9+log(9)^2[ = ]9; 13.827...[, there are two primes 11 and 13 and this is the first such interval with two primes, hence a(2) = 9.
MATHEMATICA
f[n_] := Count[Range[n + 1, n + Log[n]^2], _?PrimeQ]; seq[len_, max_] := Module[{s = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < max, i = f[n] + 1; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[15, 10^4] (* Amiram Eldar, Jun 08 2022 *)
CROSSREFS
Cf. A275235, A354842 (similar, but between k and k+log(k)).
Sequence in context: A295720 A349800 A296152 * A014764 A100498 A068952
KEYWORD
nonn
AUTHOR
Bernard Schott, Jun 08 2022
EXTENSIONS
More terms from Amiram Eldar, Jun 08 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 19:51 EDT 2024. Contains 375167 sequences. (Running on oeis4.)