A107740 - OEIS

This site is supported by donations to The OEIS Foundation.

A107740

Number of numbers m such that prime(n) = m+(digit sum of m).

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

	OFFSET	`1,26`
	COMMENTS	`a(A006378(n)) = 0; a(A048521(n)) > 0;` `a(n)<=2 for n<=10^5, conjecture: sequence is bounded.`
	EXAMPLE	`A000040(26)=101=91+(9+1)=100+(1+0+0): a(26)=#{91,100}=2.`
	CROSSREFS	`Cf. A007953, A000040, A062028, A047791, A107741.` `Sequence in context: A027360 A037806 A038082 * A016016 A063059 A102675` `Adjacent sequences: A107737 A107738 A107739 * A107741 A107742 A107743`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 23 2005`

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

Last modified February 14 00:26 EST 2012. Contains 205567 sequences.