

A228518


a(n) is the least r > 1 for which the interval (r*n, r*(n+1)) contains no terms of A050376 or a(n) = 0 if no such r exists.


2



0, 0, 0, 0, 0, 0, 2, 4, 0, 2, 3, 0, 2, 0, 6, 2, 2, 3, 2, 7, 3, 2, 4, 0, 2, 7, 2, 2, 4, 3, 2, 2, 4, 2, 4, 4, 2, 2, 3, 5, 3, 2, 2, 3, 2, 2, 2, 3, 2, 4, 3, 2, 3, 4, 2, 0, 2, 2, 2, 5, 2, 2, 4, 2, 5, 2, 2, 3, 3, 2, 2, 2, 2, 4, 4, 2, 2, 3, 2, 2, 3, 2, 4, 3, 2, 3, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,7


COMMENTS

It is an a FermiDirac analog of A218831, since terms of A050376 play a role of primes in FermiDirac arithmetic (see comments in A050376).
Conjecture: a(n) = 0 iff n = 1, 2, 3, 4, 5, 6, 9, 12, 14, 24, 56.
A proof that the interval(r*n, r*(n+1)) for r > 1 always contains a term from A050376 for n = 1, 2, 3, 4, 5, 6, 9, 12, 14, 24, 56 uses similar methods of analog of Ramanujan numbers (cf. A228520) and their generalization.


LINKS



FORMULA



CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



