A156311 - OEIS

This site is supported by donations to The OEIS Foundation.

A156311

Number of ways to write prime(n) = prime(k) + prime(k+1)*m.

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

	OFFSET	`1,9`
	COMMENTS	`a(n) = #{k: prime(n) mod prime(k+1) = prime(k)};` `a(A049084(A156312(n)))>0; a(A049084(A156313(n)))=0;` `a(A049084(A156314(n)))=n and a(m)<n for m < A049084(A156314(n)).`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000`
	EXAMPLE	`A000040(14)=43: a(14) = #{3+58} = 1;` `A000040(15)=47: a(15) = #{2+315, 5+76, 13+172} = 3;` `A000040(16)=53: a(16) = #{2+317, 3+510} = 2.`
	CROSSREFS	`Sequence in context: A124407 A206442 A137581 * A189463 A113414 A112185` `Adjacent sequences: A156308 A156309 A156310 * A156312 A156313 A156314`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 07 2009`

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

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.