Let prime(i) = i-th prime (A000040), let d(i) = prime(i+1)-prime(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered.
A053597
Let prime(i) = i-th prime (A000040), let d(i) = prime(i+1)-prime(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered.
Terms
- a(0) =2a(1) =1a(2) =2a(3) =2a(4) =2a(5) =2a(6) =3a(7) =3a(8) =2a(9) =3a(10) =3a(11) =2a(12) =3a(13) =2a(14) =1a(15) =2a(16) =3a(17) =3a(18) =3a(19) =3a(20) =2a(21) =3a(22) =4a(23) =3a(24) =2a(25) =2a(26) =2a(27) =3a(28) =2a(29) =5
External references
- oeis: A053597