id:A056564 - OEIS Search Results

Search: id:A056564

Displaying 1-1 of 1 results found.

page 1

Number of times primes can be produced by taking the absolute difference between the n-th triangular number and another triangular number.

+0
3

1, 1, 3, 2, 3, 2, 2, 3, 1, 1, 3, 1, 2, 2, 1, 1, 2, 2, 1, 3, 1, 1, 3, 1, 1, 1, 0, 1, 2, 2, 2, 2, 1, 0, 2, 1, 2, 2, 1, 0, 3, 1, 2, 2, 0, 1, 1, 2, 0, 2, 1, 1, 3, 2, 1, 2, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 0, 3, 1, 1, 1, 0, 1, 2, 2, 1, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`a(n) =A056562(n)+A056563(n) =number of primes (with multiplicity) in {m, m+1, 2m-1, 2m+3}`
	EXAMPLE	`a(2)=3 because 2nd triangular number is 3, and all three of 3-0=3, 3-1=2, and 6-3=3 are prime [n=2 is the only case where there is multiplicity].`
	CROSSREFS	`Cf. A000217, A001227, A056562, A0565643` `Sequence in context: A099891 A096835 A064654 this_sequence A082844 A101406 A097509` `Adjacent sequences: A056561 A056562 A056563 this_sequence A056565 A056566 A056567`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 27 2000`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research