The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A343496 First point of the straight lines in A340649. 1
5, 31, 194, 1061, 6456, 40080, 251721, 1617206, 10553419, 69709769, 465769825 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
prime(a(n)+1) - prime(a(n)) = n*2. E.g., for n=4: prime(a(4)+1) - prime(a(4)) = 4*2, prime(1062) - prime(1061) = 4*2, 8521 - 8513 = 8.
LINKS
FORMULA
a(n) = smallest k that satisfies A001223(k) = 2*n and A340649(k) = A141042(k).
EXAMPLE
For n=1, consider k's with prime gap 1*2 = 2, i.e., k's such that A001223(k)=2. k=5 is the first place where A001223(k)=2 and A141042(k)=A340649(k), so a(1)=5.
For n=2, consider k's with prime gap 2*2 = 4, i.e., k's such that A001223(k)=4. k=31 is the first place where A001223(k)=4 and A141042(k)=A340649(k), so a(2)=31.
For n=3, consider k's with prime gap 3*2 = 6, i.e., k's such that A001223(k)=6. k=194 is the first place where A001223(k)=6 and A141042(k)=A340649(k), so a(3)=194.
PROG
(Ruby) n = 1
last_prime = 2
find_gap = 2
result = []
Prime.each(10_000) do |prime|
next if prime == 2
gap = prime - last_prime
if gap == find_gap
value = (n * prime) % last_prime
if value == n * gap
result << n
find_gap += 2
end
end
n += 1
last_prime = prime
end
p result
CROSSREFS
Sequence in context: A015540 A014987 A365741 * A108079 A164038 A260782
KEYWORD
nonn,more
AUTHOR
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 May 21 13:44 EDT 2024. Contains 372738 sequences. (Running on oeis4.)