OFFSET
1,2
COMMENTS
Pentaphile numbers are described in A348518.
The idea for this sequence comes from the French website Diophante (see link).
It is possible to generalize for "k-phile" or "k-phobe" numbers (see Crossrefs).
The set of k-phobe numbers is always finite and the smallest one is always 1; here, there exist 68 pentaphobe numbers and the largest one is 240.
LINKS
Diophante, A496 - Pentaphiles et pentaphobes (in French).
EXAMPLE
There are no 5 positive integers b_1 < b_2 < b_3 < b_4 < b_5 such that b_1 divides b_2, b_2 divides b_3, b_3 divides b_4, b_4 divides b_5, and 32 = b_1 + b_2 + b_3 + b_4 + b_5, hence 32 is a term.
PROG
(PARI) isok(k) = forpart(p=k, if (#Set(p) == 5, if (!(p[2] % p[1]) && !(p[3] % p[2]) && !(p[4] % p[3]) && !(p[5] % p[4]), return(0))), , [5, 5]); return(1); \\ Michel Marcus, Nov 14 2021
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Bernard Schott, Nov 02 2021
STATUS
approved