login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056564 Number of times primes can be produced by taking the absolute difference between the n-th triangular number and another triangular number. 2
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; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..104.

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: A237838 A064654 A162229 * A082844 A101406 A097509

Adjacent sequences:  A056561 A056562 A056563 * A056565 A056566 A056567

KEYWORD

nonn

AUTHOR

Henry Bottomley, Jun 27 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

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

Last modified July 31 05:26 EDT 2014. Contains 245079 sequences.