login
Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n.
2

%I #9 May 26 2020 06:29:18

%S 3,0,3,2,2,2,2,1,3,1,4,2,0,2,3,4,3,2,1,3,2,4,4,2,2,4,2,2,3,4,1,4,1,2,

%T 3,3,1,4,5,4,3,3,1,5,2,5,1,3,2,7,3,5,1,3,3,7,3,4,3,5,1,6,2,2,3,5,0,6,

%U 2,6,4,6,2,8,1,5,2,5,2,9,4,5,1,4,1,9,5,5

%N Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n.

%C a(0), not included in the sequence, is infinite, as no prime has any unrelated number.

%C Apparently this gives the indices k such that A045763(k)=n. - _R. J. Mathar_, Jun 27 2007

%H Jinyuan Wang, <a href="/A070298/b070298.txt">Table of n, a(n) for n = 1..5000</a>

%e a(1) = 3, the three numbers m being 6,8 and 9. The corresponding single unrelated numbers are 4, 6 and 6 respectively.

%Y Cf. A045763, A070297.

%K nonn

%O 1,1

%A _Amarnath Murthy_, May 10 2002

%E Corrected and extended by _R. J. Mathar_, Jun 27 2007

%E More terms from _Jinyuan Wang_, May 25 2020