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!)
A228945 Number of ways to write highly composite numbers (A002182(n)) as the difference of two primes, both <= 2*A002182(n). 1
0, 0, 1, 1, 3, 6, 6, 7, 11, 19, 25, 28, 40, 61, 87, 109, 138, 184, 326, 437, 550, 721, 935, 1103, 1326, 1792, 1903, 2351, 3261, 4119, 5773, 7386, 8736, 10307, 14404 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
a(n)=A202472(A002182(n)/2) for n>1.
Conjecture: (a) This sequence is strictly increasing beginning with n=7. (b) If p is the smallest prime with p>A002182(n)+1, then p-A002182(n) is prime. This is a strengthening of a conjecture regarding A117825.
LINKS
EXAMPLE
a(5)=3, since 12=23-11=19-7=17-5.
CROSSREFS
Sequence in context: A130482 A239318 A177783 * A348467 A178746 A229986
KEYWORD
more,nonn
AUTHOR
Jaycob Coleman, Sep 08 2013
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 30 16:06 EDT 2024. Contains 372136 sequences. (Running on oeis4.)