A082500 -id:A082500 - cp's OEIS frontend

A239636 Distance between the two occurrences of n-th prime in A082500.

1, 1, 3, 5, 11, 13, 19, 21, 27, 37, 39, 49, 55, 57, 63, 73, 83, 85, 95, 101, 103, 113, 119, 129, 143, 149, 151, 157, 159, 165, 191, 197, 207, 209, 227, 229, 239, 249, 255, 265, 275, 277, 295, 297, 303, 305, 327, 349, 355, 357, 363, 373, 375, 393, 403, 413

Offset: 1

Reinhard Zumkeller, Mar 22 2014

nonn

a(n) = 2*A000040(n) - 1 - 2*A049084(A000040(n)).

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Haskell
```
a239636 = subtract 1 . (* 2) . a014689
```

a(n) = 2*A014689(n) - 1.

A109400 For all k: the first k numbers followed by the first k primes.

Original entry on oeis.org

1, 2, 1, 2, 2, 3, 1, 2, 3, 2, 3, 5, 1, 2, 3, 4, 2, 3, 5, 7, 1, 2, 3, 4, 5, 2, 3, 5, 7, 11, 1, 2, 3, 4, 5, 6, 2, 3, 5, 7, 11, 13, 1, 2, 3, 4, 5, 6, 7, 2, 3, 5, 7, 11, 13, 17, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 5, 7, 11, 13, 17, 19, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 5, 7, 11, 13, 17, 19, 23

Offset: 1

Reinhard Zumkeller, Jun 27 2005

nonn

a(k*(k-1) + m) = a(A002378(k-1) + m) = m for 1<=m<=k;
a(k^2 + m) = a(A000290(k) + m) = A000040(m) for 1<=m<=k;
see A109401 for number of primes and A109402 for partial sums.

			1, 2; 1 2, 2 3; 1 2 3, 2 3 5; 1 2 3 4, 2 3 5 7; 1 2 ...

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A002260, A037126, A082500, A000040.

a109400 n = a109400_list !! (n-1)
a109400_list = concat $ zipWith (++) a002260_tabl a037126_tabl
-- Reinhard Zumkeller, Jun 23 2015, Dec 11 2011

With[{prs=Prime[Range[20]]},Flatten[Table[{Range[n],Take[prs,n]},{n,10}]]] (* Harvey P. Dale, Dec 08 2011 *)

cp's OEIS Frontend

A239636 Distance between the two occurrences of n-th prime in A082500.

Views

Author

Keywords

Comments

Links

Programs

Haskell

Formula