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!)
A246795 a(n) = A246793(A005669(n)). 2
1, 1, 2, 3, 5, 5, 7, 8, 9, 8, 12, 10, 11, 12, 9, 12, 15, 10, 11, 15, 10, 17, 13, 16, 20, 17, 21, 19, 19, 24, 13, 23, 18, 21, 17, 26, 26, 29, 19, 23, 23, 25, 27, 27, 29, 24, 26, 25, 33, 28, 32, 32, 31, 36, 35, 37, 42, 33, 28, 35, 30, 36, 30, 34, 44, 29, 32, 34, 33, 30, 40, 38, 34, 44 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,3
COMMENTS
This sequence evaluates the largest m's defined in A246793 for the index of primes where largest gaps occurs.
Conjecture: For every n, a(n) is positive.
a(75) = 44 and A246794(75) = 6 hence A182134(34952141021660495 - k) = k for 5 < k < 45, where 34952141021660495 = A005669(75).
LINKS
CROSSREFS
Sequence in context: A077381 A225636 A023838 * A089625 A092391 A187322
KEYWORD
nonn,hard
AUTHOR
Farideh Firoozbakht, Oct 24 2014
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 April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)