id:A107740 - OEIS Search Results

Search: id:A107740

Displaying 1-1 of 1 results found.

page 1

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

+0
6

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; listen)

	OFFSET	`1,26`
	COMMENT	`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 this_sequence A016016 A063059 A102675` `Adjacent sequences: A107737 A107738 A107739 this_sequence A107741 A107742 A107743`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 23 2005`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research