login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324385 Distance from the n-th highly composite number, A002182(n), from the largest prime <= A002182(n). 2
0, 1, 1, 1, 1, 5, 1, 1, 7, 1, 1, 1, 1, 1, 1, 11, 17, 1, 1, 1, 13, 11, 11, 19, 17, 13, 1, 23, 1, 1, 13, 17, 17, 13, 17, 1, 17, 1, 1, 23, 17, 17, 17, 1, 19, 83, 37, 23, 17, 23, 1, 43, 19, 1, 19, 43, 19, 31, 23, 19, 31, 19, 19, 1, 1, 1, 1, 47, 1, 31, 47, 23, 53, 23, 83, 37, 31, 1, 31, 1, 23, 61, 1, 41, 47, 61, 41, 29, 41, 29, 43, 73, 29, 47, 31, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,6

COMMENTS

Like in A141345 it appears (or is conjectured) that no composite numbers ever occur here. Taken together, this leads to McEachen's conjecture given in A117825. Here in range 2..10000 term 1 occurs for 313 times.

LINKS

Antti Karttunen, Table of n, a(n) for n = 2..10000

FORMULA

a(n) = A002182(n) - A007917(A002182(n)).

EXAMPLE

A002182(2) = 2, the largest prime less than or equal to 2 is 2 itself, thus a(2) = 2-2 = 0.

A002182(7) = 36, the largest prime <= 36 is 31, thus a(7) = 36-31 = 5.

PROG

(PARI) A324385(n) = (A002182(n)-precprime(A002182(n)));

CROSSREFS

Cf. A002182, A007917, A060270, A117825, A141345.

Sequence in context: A328098 A200401 A214228 * A111720 A029646 A152721

Adjacent sequences:  A324382 A324383 A324384 * A324386 A324387 A324388

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 26 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 19:20 EDT 2020. Contains 335524 sequences. (Running on oeis4.)