|
|
A068597
|
|
Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.
|
|
1
|
|
|
2, 3, 4, 6, 8, 12, 24, 48, 60, 108, 168, 264, 348, 360, 384, 480, 720, 864, 888, 1020, 1320, 1440, 2040, 2064, 2448, 2880, 3024, 3120, 3168, 3624, 4680, 4920, 5388, 5400, 5880, 6600, 6720, 6984, 7080, 7560, 8424, 8700, 8784, 9744, 9840, 9888, 10080
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, B8.
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) is(n)=if(isprime(n-1) && isprime(n\2-1), for(k=3, log(n)\log(2), if(bigomega(n-k)>k, return(0))); 1, n<5 && n>1) \\ Charles R Greathouse IV, Sep 20 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|