A139394 - OEIS

This site is supported by donations to The OEIS Foundation.

A139394

a(n)=A024899(n)-A024898(n).

0, 0, 0, 1, 1, 0, 2, 2, 2, 1, 2, 2, 1, 3, 4, 3, 3, 2, 2, 3, 3, 3, 4, 0, 1, 5, 4, 4, 7, 7, 8, 7, 6, 8, 4, 4, 6, 4, 5, 5, 3, 4, 3, 6, 6, 9, 10, 9, 11, 11, 13, 8, 8, 8, 7, 8, 10, 9, 8, 10, 12, 12, 10, 11, 9, 8, 7, 8, 8, 5, 7, 6, 8, 7, 8, 9, 9, 13, 13, 11, 11, 12, 13, 11, 12, 13, 9, 11, 10, 11, 10, 6, 9 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,7`
	COMMENTS	`Contribution from Zak Seidov (zakseidov(AT)yahoo.com), Nov 12 2008: (Start)` `Conjecture: a(n) > 0, except n=1,2,3,6,24, when a(n)=0.` `This fact can be apparently explained by existence of twin primes. (End)`
	LINKS	`Zak Seidov, Table of n, a(n) for n = 1..3000.` `Zak Seidov, A024899(n) > A024898(n) [From Zak Seidov (zakseidov(AT)yahoo.com), Nov 12 2008]`
	CROSSREFS	`Cf. A024898, A024899.` `Sequence in context: A189225 A169988 A067597 * A125829 A077099 A160385` `Adjacent sequences: A139391 A139392 A139393 * A139395 A139396 A139397`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Apr 18 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.