id:A053597 - OEIS Search Results

Search: id:A053597

Displaying 1-1 of 1 results found.

page 1

Let p(i) = i-th prime (A000040), let d(i) = p(i+1)-p(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered.

+0
3

2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 3, 2, 1, 2, 3, 3, 3, 3, 2, 3, 4, 3, 2, 2, 2, 3, 2, 5, 4, 3, 2, 3, 2, 1, 2, 2, 1, 3, 2, 3, 2, 3, 2, 1, 3, 2, 3, 4, 3, 3, 2, 1, 1, 2, 3, 5, 4, 4, 4, 3, 2, 5, 5, 5, 4, 5, 4, 3, 2, 2, 1, 2, 3, 3, 2, 4, 3, 2, 2, 4, 3, 2, 3, 4, 3, 2, 4, 3, 3, 2, 2, 6, 5, 4, 5, 4, 3, 2, 2, 1, 2, 3, 2 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research