|
Search: id:A070298
|
|
|
| A070298 |
|
Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n. |
|
+0
2
|
|
| 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, 3, 3, 1, 4, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(0), not included in the sequence, is infinite, as no prime has any unrelated number.
Apparently this gives the indices k such that A045763(k)=n. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2007
|
|
EXAMPLE
|
a(1) = 3, the three numbers m being 6,8 and 9. The corresponding single unrelated numbers are 4, 6 and 6 respectively.
|
|
CROSSREFS
|
Cf. A070297.
Cf. A045763.
Sequence in context: A166445 A085919 A105824 this_sequence A024938 A004604 A016035
Adjacent sequences: A070295 A070296 A070297 this_sequence A070299 A070300 A070301
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 10 2002
|
|
EXTENSIONS
|
Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 27 2007
|
|
|
Search completed in 0.002 seconds
|
